45 search results - page 4 / 9 » Distortion Is Fixed Parameter Tractable |
80
Voted
ALGORITHMICA
2010
15 years 24 days ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
59
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
CORR
2010
Springer
14 years 10 months ago
2010
Springer
116
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
115
Voted
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...