Sciweavers

1536 search results - page 2 / 308
» Approximately Dominating Representatives
Sort
View
COCOON
2007
Springer
14 years 1 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
COLOGNETWENTE
2007
13 years 9 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
WSCG
2004
106views more  WSCG 2004»
13 years 9 months ago
Recognition of Occluded Objects Using Curvature
New approaches of object representation reliable for partially occluded objects recognition are introduced in this article. Objects are represented by their boundaries, which are ...
Filip Krolupper
IJCAI
2007
13 years 9 months ago
Iterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
Shih-Fen Cheng, Michael P. Wellman
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 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