Search Sciweavers | Sciweavers

5595 search results - page 58 / 1119

» Approximation Algorithms for Clustering Problems

104

click to vote

WADS
2005
Springer

88views Algorithms» more WADS 2005»

Approximating the Online Set Multicover Problems via Randomized Winnowing

15 years 10 months ago

Download www.cs.uic.edu

Piotr Berman, Bhaskar DasGupta

claim paper

Read More »

122

click to vote

ISAAC
2001
Springer

99views Algorithms» more ISAAC 2001»

Tree-Approximations for the Weighted Cost-Distance Problem

15 years 9 months ago

Download cone.informatik.uni-freiburg.de

Christian Schindelhauer, Birgitta Weber

claim paper

Read More »

105

click to vote

STOC
1989
ACM

66views Algorithms» more STOC 1989»

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

15 years 8 months ago

Download users.soe.ucsc.edu

Leonard Pitt, Manfred K. Warmuth

claim paper

Read More »

114

click to vote

CIAC
2006
Springer

131views Algorithms» more CIAC 2006»

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

15 years 8 months ago

Download macs.cs.cityu.edu.hk

Erez Kantor, David Peleg

claim paper

Read More »

111

click to vote

COCO
1997
Springer

77views Algorithms» more COCO 1997»

Constraint Satisfaction: The Approximability of Minimization Problems

15 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers