1040 search results - page 47 / 208 » Rounding algorithms for covering problems |
152
Voted
ALGORITHMICA
2006
15 years 3 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
142
Voted
SODA
2010
ACM
16 years 29 days ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
117
Voted
CCCG
2008
15 years 5 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
110
Voted
AAAI
2006
15 years 5 months ago
2006
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
135
Voted
FPL
1997
Springer
15 years 7 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...