Sciweavers

206 search results - page 28 / 42
» A distributed approximation algorithm for the minimum degree...
Sort
View
PPSN
2004
Springer
14 years 1 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
IPPS
2007
IEEE
14 years 2 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...