Approximation Algorithms for the Unsplittable Flow Problem

Author： Chakrabarti Amit   Chekuri Chandra   Gupta Anupam   Kumar Amit  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.47, Iss.1, 2007-01, pp. : 53-78

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Approximation algorithms for a hierarchically structured bin packing problem

By Codenotti B.   De Marco G.   Leoncini M.   Montangero M.   Santini M.  

Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. : 215-221

Elsevier

Access to resources Recommend Favorite

On approximation algorithms for the terminal Steiner tree problem

By Drake D.E.   Hougardy S.  

Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. : 15-18

Elsevier

Access to resources Recommend Favorite

Better and Simpler Approximation Algorithms for the Stable Marriage Problem

By Király Zoltán  

Algorithmica, Vol. 60, Iss. 1, 2011-05 ,pp. : 3-20

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for the Average-Case Tree Searching Problem

By Cicalese Ferdinando   Jacobs Tobias   Laber Eduardo   Molinaro Marco  

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1045-1074

Springer Publishing Company

Access to resources Recommend Favorite

On polynomial-time approximation algorithms for the variable length scheduling problem

By Czumaj A.   Gasieniec L.   Gaur D.R.   Krishnamurti R.   Rytter W.   Zito M.  

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 489-495

Elsevier

Access to resources Recommend Favorite