2698 search results - page 12 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
105
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
STOC
2007
ACM
15 years 12 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
111
click to vote
COCO
2007
Springer
15 years 5 months ago
2007
Springer
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
DEBU
2010
14 years 11 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
110
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...