Search Sciweavers | Sciweavers

49 search results - page 1 / 10

» Constant-time distributed dominating set approximation

112

click to vote

PROPERTYTESTING
2010

152views Theoretical Computer Science» more PROPERTYTESTING 2010»

On Constant Time Approximation of Parameters of Bounded Degree Graphs

14 years 7 months ago

Download www.math.tau.ac.il

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...

Noga Alon

claim paper

Read More »

101

click to vote

FOCS
2008
IEEE

167views Theoretical Computer Science» more FOCS 2008»

Constant-Time Approximation Algorithms via Local Improvements

15 years 3 months ago

Download people.csail.mit.edu

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...

Huy N. Nguyen, Krzysztof Onak

claim paper

Read More »

click to vote

CCCG
2010

222views Computational Geometry» more CCCG 2010»

3d local algorithm for dominating sets of unit disk graphs

14 years 11 months ago

Download www.cs.umanitoba.ca

A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...

Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...

claim paper

Read More »

click to vote

IPPS
2007
IEEE

147views Distributed And Parallel Com...» more IPPS 2007»

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set

15 years 3 months ago

Download www.cecs.uci.edu

Sayaka Kamei, Hirotsugu Kakugawa

claim paper

Read More »