Sciweavers

7006 search results - page 142 / 1402
» Approximation Algorithms
Sort
View
67
Voted
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 4 months ago
Approximate local search in combinatorial optimization
srn.com/abstract=423560
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
99
Voted
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 1 months ago
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Ur...
188
Voted
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
15 years 19 days ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
113
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 2 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...
113
Voted
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 8 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...