478 search results - page 1 / 96 » Approximation algorithms for general packing problems and th... |
WEA
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
MOR
2000
13 years 4 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
ESCAPE
2007
Springer
13 years 10 months ago
2007
Springer