500 search results - page 44 / 100 » Approximation algorithms for maximum independent set of pseu... |
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
83
Voted
WINE
2009
Springer
15 years 8 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
131
Voted
JAL
2006
15 years 1 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
131
click to vote
ISAAC
2000
Springer
15 years 5 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
124
click to vote
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...