134 search results - page 1 / 27 » On Constant Time Approximation of Parameters of Bounded Degr... |
PROPERTYTESTING
2010
13 years 2 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
FAW
2009
Springer
13 years 11 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
WDAG
2010
Springer
13 years 2 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...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...