Sciweavers

3875 search results - page 21 / 775

» Approximation Algorithms for the Max-coloring Problem

23

CIAC
2006
Springer

131views Algorithms» more CIAC 2006»

Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems

13 years 11 months ago

Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems

Download macs.cs.cityu.edu.hk

Erez Kantor, David Peleg

claim paper

Read More »

20

COCO
1997
Springer

77views Algorithms» more COCO 1997»

Constraint Satisfaction: The Approximability of Minimization Problems

13 years 11 months ago

Constraint Satisfaction: The Approximability of Minimization Problems

Download people.csail.mit.edu

Sanjeev Khanna, Madhu Sudan, Luca Trevisan

claim paper

Read More »

23

SODA
2000
ACM

137views Algorithms» more SODA 2000»

Approximating the maximum quadratic assignment problem

13 years 8 months ago

Approximating the maximum quadratic assignment problem

Download www.cs.princeton.edu

Esther M. Arkin, Refael Hassin

claim paper

Read More »

16

CCCG
2006

97views Computational Geometry» more CCCG 2006»

An Improved Approximation Factor For The Unit Disk Covering Problem

13 years 9 months ago

An Improved Approximation Factor For The Unit Disk Covering Problem

Download research.cs.queensu.ca

We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...

Sada Narayanappa, Petr Vojtechovský

claim paper

Read More »

31

ISAAC
2010
Springer

265views Algorithms» more ISAAC 2010»

On the Approximability of the Maximum Interval Constrained Coloring Problem

13 years 5 months ago

On the Approximability of the Maximum Interval Constrained Coloring Problem

Download www.mpi-inf.mpg.de

Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...

claim paper

Read More »

« Prev « First page 21 / 775 Last » Next »