×

Found 23 Documents (Results 1–23)

Approximation algorithms for stochastic orienteering. (English) Zbl 1423.90106

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1522-1538 (2012).
PDFBibTeX XMLCite
Full Text: Link

Capacitated vehicle routing with non-uniform speeds. (English) Zbl 1341.90016

Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 235-247 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for optimal decision trees and adaptive TSP problems. (English) Zbl 1288.68267

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 690-701 (2010).
MSC:  68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Thresholded covering algorithms for robust and max-min optimization. (English) Zbl 1287.68180

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 262-274 (2010).
MSC:  68W25 90C57 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum makespan multi-vehicle dial-a-ride. (English) Zbl 1256.90014

Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 540-552 (2009).
MSC:  90B06 68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

The directed minimum latency problem. (English) Zbl 1159.68674

Goel, Ashish (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008, Boston, MA, USA, August 25–27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85362-6/pbk). Lecture Notes in Computer Science 5171, 193-206 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Poly-logarithmic approximation algorithms for directed vehicle routing problems. (English) Zbl 1171.90511

Charikar, Moses (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20–22, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74207-4/pbk). Lecture Notes in Computer Science 4627, 257-270 (2007).
PDFBibTeX XMLCite
Full Text: DOI Link

Dial a ride from \(k\)-forest. (English) Zbl 1151.68745

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 241-252 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Minimum vehicle routing with a common deadline. (English) Zbl 1155.68583

Díaz, Josep (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006, and 10th international workshop on randomization and computation, RANDOM 2006, Barcelona, Spain, August 28–30, 2006. Proceedings. Berlin: Springer (ISBN 3-540-38044-2/pbk). Lecture Notes in Computer Science 4110, 212-223 (2006).
MSC:  68W25 90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for requirement cut on graphs. (English) Zbl 1142.05368

Chekuri, Chandra (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 8th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2005, and 9th international workshop on randomization and computation, RANDOM 2005, Berkeley, CA, USA, August 22–24, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28239-4/pbk). Lecture Notes in Computer Science 3624, 209-220 (2005).
MSC:  05C85 05C40 68W25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software