Sciweavers

3875 search results - page 14 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
13 years 11 months ago
Fast Approximation Algorithms for Multicommodity Flow Problems
Frank Thomson Leighton, Fillia Makedon, Serge A. P...
SODA
1998
ACM
89views Algorithms» more  SODA 1998»
13 years 8 months ago
Approximation Algorithms for Directed Steiner Problems
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zu...
ATAL
2007
Springer
13 years 11 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
13 years 11 months ago
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
4OR
2008
56views more  4OR 2008»
13 years 7 months ago
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
Cédric Bentz