500 search results - page 14 / 100 » Approximation algorithms for maximum independent set of pseu... |
170
click to vote
TSP
2010
15 years 22 days ago
2010
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
206
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
159
click to vote
FOCS
2009
IEEE
16 years 24 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
182
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...