840 search results - page 28 / 168 » Inapproximability of Combinatorial Optimization Problems |
PROPERTYTESTING
2010
13 years 8 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
WINE
2009
Springer
14 years 5 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
DISOPT
2007
13 years 11 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
EXPCS
2007
14 years 2 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...