7129 search results - page 59 / 1426 » Approximation Algorithms for Treewidth |
142
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
109
click to vote
EOR
2006
15 years 4 months ago
2006
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
163
click to vote
AICT
2005
IEEE
15 years 10 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
157
Voted
ICDCS
2008
IEEE
15 years 11 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
145
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...