478 search results - page 8 / 96 » Approximation algorithms for general packing problems and th... |
COMCOM
2008
13 years 7 months ago
2008
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
NIPS
2001
13 years 8 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
APPROX
2004
Springer
14 years 26 days ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...