1389 search results - page 191 / 278 » Improved Approximation Algorithms for Label Cover Problems |
121
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
112
click to vote
ALMOB
2008
15 years 3 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
125
click to vote
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
162
click to vote
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
104
click to vote
COCO
1998
Springer
15 years 7 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...