455 search results - page 60 / 91 » Approximation Algorithms for Partial Covering Problems |
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
104
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
191
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
94
Voted
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...