×

Found 42 Documents (Results 1–42)

Approximation algorithms for the unsplittable flow problem on paths and trees. (English) Zbl 1354.68297

D’Souza, Deepak (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2012). Selected papers based on the presentations at the 32nd conference, Hyderabad, India, December 15–17, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-47-7). LIPIcs – Leibniz International Proceedings in Informatics 18, 267-275 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Multicommodity flows and cuts in polymatroidal networks. (English) Zbl 1347.68278

Proceedings of the 3rd conference on innovations in theoretical computer science, ITCS’12, Cambridge, MA, USA, January 8–10, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1115-1). 399-408 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Routing in undirected graphs with constant congestion. (English) Zbl 1286.05061

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 855-874 (2012).
MSC:  05C21 05C38 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. (English) Zbl 1286.05063

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 27-40 (2012).
MSC:  05C21 91B26
PDFBibTeX XMLCite
Full Text: DOI Link

When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks. (English) Zbl 1286.05059

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 19-26 (2012).
MSC:  05C21
PDFBibTeX XMLCite
Full Text: DOI arXiv

On solving the rooted delay- and delay-variation-constrained Steiner tree problem. (English) Zbl 1370.68237

Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 225-236 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Theoretical investigation of aggregation in pseudo-polynomial network-flow models. (English) Zbl 1370.90055

Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 213-224 (2012).
MSC:  90B10 05C21 90C59
PDFBibTeX XMLCite
Full Text: DOI

Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp. 2nd ed. (English) Zbl 1237.05199

Cambridge: Cambridge University Press (ISBN 978-0-521-73653-4/pbk; 978-0-521-51718-8/hbk; 978-1-139-21056-0/ebook). xii, 189 p. (2012).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 3

Main Field

all top 3

Software