Sciweavers

7150 search results - page 172 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 7 months ago
Approximate local search in combinatorial optimization
srn.com/abstract=423560
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 4 months ago
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Ur...
238
Voted
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
15 years 4 months ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
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
CORR
2006
Springer
172views Education» more  CORR 2006»
15 years 6 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan