2 search results - page 1 / 1 » A quasi-PTAS for unsplittable flow on line graphs |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...