7129 search results - page 160 / 1426 » Approximation Algorithms for Treewidth |
129
Voted
DEBU
2000
15 years 3 months ago
2000
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...
117
Voted
CCCG
2006
15 years 4 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
126
click to vote
IPCO
2001
15 years 4 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
99
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
122
Voted
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...