237 search results - page 14 / 48 » Improved Approximations of Independent Sets in Bounded-Degre... |
174
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
175
click to vote
ISAAC
2009
Springer
16 years 19 days 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...
207
click to vote
ALGOSENSORS
2009
Springer
16 years 20 days ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
175
click to vote
ISAAC
2009
Springer
16 years 19 days ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
262
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...