642 search results - page 25 / 129 » Approximation Algorithms for Minimum K-Cut |
101
click to vote
MOBIHOC
2010
ACM
14 years 9 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
196
Voted
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
101
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
139
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...