9572 search results - page 99 / 1915 » Cover Algorithms and Their Combination |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
ASIAN
2006
Springer
15 years 3 months ago
2006
Springer
SODA
2004
ACM
15 years 1 months ago
2004
ACM
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...