WDAG 2010 - PDF Preprint Papers

WDAG 2010 International Workshop on Distributed Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WDAG-2010 Paper

click to vote

WDAG
2010
Springer

87views Algorithms» more WDAG 2010»

Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

1 years 3 months ago

Download dcg.ethz.ch

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	87	Minimum Dominating Set Approximation in Graphs of Bounded Arboricity	claim
2	82	The 2010 Edsger W. Dijkstra Prize in Distributed Computing	claim
3	76	A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware	claim
4	73	Implementing Fault-Tolerant Services Using State Machines: Beyond Replication	claim
5	71	Exclusive Perpetual Ring Exploration without Chirality	claim
6	71	Scalable Flat-Combining Based Synchronous Queues	claim
7	68	The Computational Structure of Progress Conditions	claim
8	68	Leader Election Problem versus Pattern Formation Problem	claim
9	67	Distributed Contention Resolution in Wireless Networks	claim
10	67	Anonymous Asynchronous Systems: The Case of Failure Detectors	claim
11	66	Brief Announcement: Stabilizing Consensus with the Power of Two Choices	claim
12	65	Transactions as the Foundation of a Memory Consistency Model	claim
13	64	Scalable Quantum Consensus for Crash Failures	claim
14	63	It's on Me! The Benefit of Altruism in BAR Environments	claim
15	63	Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony	claim
16	63	Fast Randomized Test-and-Set and Renaming	claim
17	60	Fast Asynchronous Consensus with Optimal Resilience	claim
18	59	What Is the Use of Collision Detection (in Wireless Networks)?	claim
19	55	The Cost of Privatization	claim
20	52	Brief Announcement: Failure Detectors Encapsulate Fairness	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers