3019 search results - page 151 / 604 » Approximating the Domatic Number |
361
click to vote
AAIM
2011
Springer
14 years 10 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
180
click to vote
JCPHY
2011
14 years 9 months ago
2011
A new numerical method for approximating highly oscillatory wave fields as a superposition of Gaussian beams is presented. The method estimates the number of beams and their para...
163
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
200
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
185
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...