3875 search results - page 99 / 775 » Approximation algorithms for the 0-extension problem |
138
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
153
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
137
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
119
click to vote
TALG
2010
15 years 2 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
134
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...