3341 search results - page 372 / 669 » On Bounded Queries and Approximation |
161
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
165
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
183
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
192
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
222
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...