Sciweavers

7930 search results - page 258 / 1586
» Greedy in Approximation Algorithms
Sort
View
STOC
2000
ACM
81views Algorithms» more  STOC 2000»
15 years 10 months ago
A unified approach to approximating resource allocation and scheduling
Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Jose...
SODA
2003
ACM
94views Algorithms» more  SODA 2003»
15 years 8 months ago
Sublinear-time approximation of Euclidean minimum spanning tree
Artur Czumaj, Funda Ergün, Lance Fortnow, Avn...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
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...
Christoph Lenzen, Roger Wattenhofer
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
16 years 1 months ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
ISITA
2010
15 years 4 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...