Sciweavers

4255 search results - page 25 / 851
» Cover
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 27 days ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
ICALP
2010
Springer
14 years 9 days ago
SDP Gaps for 2-to-1 and Other Label-Cover Variants
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell...
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
13 years 11 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
IJCAI
1997
13 years 8 months ago
Tractable Cover Compilations
Tractable covers are introduced as a new ap­ proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen­ eral framework is presented. Then, two ...
Yacine Boufkhad, Éric Grégoire, Pier...
EJC
2010
13 years 7 months ago
Partial covers of PG(n, q)
In this paper, we investigate some properties of partial covers of PG(n, q). We show that a set of q + a hyperplanes, q 81, a < (q - 1)/3, or q > 13 and a (q - 10)/4, that...
Stefan M. Dodunekov, Leo Storme, Geertrui Van de V...