Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

46

Voted

COCOON
2007
Springer

favoriteEmaildiscussreport

158views Combinatorics» more COCOON 2007»

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families

14 years 5 months ago

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families

Download math.la.asu.edu

We give eﬃcient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we indicate that no eﬃcient distributed algorithm for the minimum weight connected dominating set exists.

Andrzej Czygrinow, Michal Hanckowiak

Real-time Traffic

COCOON 2007 | Connected Dominating Set | Dominating Set | Minimum Dominating Set |

claim paper

Related Content

» Distributed Almost Exact Approximations for MinorClosed Families

» Distributed and parallel algorithms for weighted vertex cover and other covering problems

» Some babystep giantstep algorithms for the low hamming weight discrete logarithm problem

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» Distributed algorithms for covering packing and maximum weighted matching

» Distributed Approximation Algorithms for Finding 2EdgeConnected Subgraphs

» Approximation Algorithms for MinMax Generalization Problems

» Approximation Algorithms for Some Graph Partitioning Problems

» A Local 2Approximation Algorithm for the Vertex Cover Problem

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	COCOON
Authors	Andrzej Czygrinow, Michal Hanckowiak

Comments (0)