SPAA 2010 - PDF Preprint Papers

SPAA 2010 ACM Symposium on Parallel Algorithms and Architectures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SPAA-2010 Paper

click to vote

SPAA
2010
ACM

282views Distributed And Parallel Com...» more SPAA 2010»

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

14 years 5 months ago

Download www.cs.helsinki.fi

We present a distributed algorithm that ﬁnds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...

Matti Åstrand, Jukka Suomela

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	282	Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks	claim
2	206	Brief announcement: byzantine agreement with homonyms	claim
3	198	On the bit communication complexity of randomized rumor spreading	claim
4	196	Implementing and evaluating nested parallel transactions in software transactional memory	claim
5	195	Flat combining and the synchronization-parallelism tradeoff	claim
6	191	Basic network creation games	claim
7	179	Towards optimizing energy costs of algorithms for shared memory architectures	claim
8	174	Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications	claim
9	174	Scheduling to minimize power consumption using submodular functions	claim
10	171	Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages	claim
11	168	Lightweight, robust adaptivity for software transactional memory	claim
12	162	TLRW: return of the read-write lock	claim
13	161	Securing every bit: authenticated broadcast in radio networks	claim
14	153	Simplifying concurrent algorithms by exploiting hardware transactional memory	claim
15	152	Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures	claim
16	141	Tree network coding for peer-to-peer networks	claim
17	137	Low depth cache-oblivious algorithms	claim
18	133	New algorithms for efficient parallel string comparison	claim
19	133	Best-effort group service in dynamic networks	claim
20	132	Multi-sided shared coins and randomized set-agreement	claim
21	129	Managing the complexity of lookahead for LU factorization with pivoting	claim
22	128	Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem	claim
23	124	Collaborative scoring with dishonest participants	claim
24	122	Transactions in the jungle	claim
25	122	Deadlock avoidance for streaming computations with filtering	claim
26	120	Brief announcement: on speculative replication of transactional systems	claim
27	119	Delays induce an exponential memory gap for rendezvous in trees	claim
28	116	Computing the throughput of probabilistic and replicated streaming applications	claim
29	113	Parallel approximation algorithms for facility-location problems	claim
30	112	Scheduling jobs with varying parallelizability to reduce variance	claim
31	109	A universal construction for wait-free transaction friendly data structures	claim
32	102	Low-contention data structures	claim
33	102	Online capacity maximization in wireless networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers