×

Found 26 Documents (Results 1–26)

Fast algorithms for knapsack via convolution and prediction. (English) Zbl 1427.68376

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1269-1282 (2018).
MSC:  68W40 90C27 90C39
PDFBibTeX XMLCite
Full Text: DOI arXiv

Stochastic \(k\)-server: how should Uber work? (English) Zbl 1442.68274

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 126, 14 p. (2017).
MSC:  68W27 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximation algorithms for movement repairmen. (English) Zbl 1405.68444

Raghavendra, Prasad (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 16th international workshop, APPROX 2013, and 17th international workshop, RANDOM 2013, Berkeley, CA, USA, August 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40327-9/pbk). Lecture Notes in Computer Science 8096, 218-232 (2013).
MSC:  68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

The online stochastic generalized assignment problem. (English) Zbl 1405.68450

Raghavendra, Prasad (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 16th international workshop, APPROX 2013, and 17th international workshop, RANDOM 2013, Berkeley, CA, USA, August 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40327-9/pbk). Lecture Notes in Computer Science 8096, 11-25 (2013).
MSC:  68W27 90B60 90C27
PDFBibTeX XMLCite
Full Text: DOI

The checkpoint problem. (English) Zbl 1306.90128

Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 219-231 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Submodular secretary problem and extensions. (English) Zbl 1305.91158

Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 39-52 (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Budgeted red-blue median and its generalizations. (English) Zbl 1287.90054

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 314-325 (2010).
MSC:  90C27 68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI

Prize-collecting Steiner network problems. (English) Zbl 1285.90049

Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13035-9/pbk). Lecture Notes in Computer Science 6080, 71-84 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. (English) Zbl 1422.68293

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 805-814 (2009).
PDFBibTeX XMLCite
Full Text: Link

Improved approximation algorithms for prize-collecting Steiner tree and TSP. (English) Zbl 1292.68161

2009 IEEE 50th annual symposium on foundations of computer science – FOCS 2009. Proceedings of the symposium, Atlanta, GA, USA, October 24–27, 2009. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-3850-1; 978-1-4244-5116-6/ebook). 427-436 (2009).
MSC:  68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Node-weighted Steiner tree and group Steiner tree in planar graphs. (English) Zbl 1248.68556

Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02926-4/pbk). Lecture Notes in Computer Science 5555, 328-340 (2009).
PDFBibTeX XMLCite
Full Text: DOI Link

Approximation algorithms via contraction decomposition. (English) Zbl 1302.05185

Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 278-287 (2007).
PDFBibTeX XMLCite

Improved lower and upper bounds for universal TSP in planar metrics. (English) Zbl 1192.90172

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 649-658 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Bidimensionality: new connections between FPT algorithms and PTASs. (English) Zbl 1297.05056

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 590-601 (2005).
MSC:  05C10 68W25 90C27
PDFBibTeX XMLCite

The bidimensional theory of bounded-genus graphs. (English) Zbl 1100.05095

Fiala, Jiří(ed.) et al., Mathematical foundations of computer science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 191-203 (2004).
PDFBibTeX XMLCite
Full Text: DOI

1. 5-approximation for treewidth of graphs excluding a graph with one crossing as a minor. (English) Zbl 1013.90125

Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2462, 67-80 (2002).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field