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...
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...
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...
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 ...
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...