796 search results - page 10 / 160 » Approximating the centroid is hard |
133
click to vote
DAM
2006
15 years 1 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
100
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
124
click to vote
ICAC
2006
IEEE
15 years 8 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
140
Voted
COCO
1994
Springer
15 years 6 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...