×

Found 4 Documents (Results 1–4)

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

Multi-budgeted matchings and matroid intersection via dependent rounding. (English) Zbl 1377.90071

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1080-1097 (2011).
PDFBibTeX XMLCite
Full Text: Link

Edge-disjoint paths in planar graphs with constant congestion. (English) Zbl 1301.68268

Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 757-766 (2006).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Year of Publication

Main Field