Sciweavers

7129 search results - page 107 / 1426
» Approximation Algorithms for Treewidth
Sort
View
TCS
2008
15 years 4 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
STOC
2005
ACM
81views Algorithms» more  STOC 2005»
16 years 5 months ago
Improved approximation algorithms for minimum-weight vertex separators
Uriel Feige, Mohammad Taghi Hajiaghayi, James R. L...
114
Voted
SODA
1998
ACM
68views Algorithms» more  SODA 1998»
15 years 6 months ago
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
82
Voted
SODA
1994
ACM
85views Algorithms» more  SODA 1994»
15 years 6 months ago
An Optimal Algorithm for Approximate Nearest Neighbor Searching
Sunil Arya, David M. Mount, Nathan S. Netanyahu, R...
90
Voted
COCOON
2007
Springer
15 years 11 months ago
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Tandem repeated regions are closely related to some genetic diseases in human beings. Once a region containing pseudo-periodic repeats is found, it is interesting to study the his...
Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen