Search Sciweavers | Sciweavers

1389 search results - page 26 / 278

» Improved Approximation Algorithms for Label Cover Problems

click to vote

SPAA
2003
ACM

82views Distributed And Parallel Com...» more SPAA 2003»

Improved approximation algorithms for the freeze-tag problem

15 years 8 months ago

Download www.ams.sunysb.edu

Esther M. Arkin, Michael A. Bender, Dongdong Ge

claim paper

Read More »

108

Voted

IPCO
1996

73views Optimization» more IPCO 1996»

Improved Randomized Approximation Algorithms for Lot-Sizing Problems

15 years 4 months ago

Download web.mit.edu

Chung-Piaw Teo, Dimitris Bertsimas

claim paper

Read More »

Voted

CORR
2008
Springer

44views Education» more CORR 2008»

An Improved Approximation Algorithm for the Column Subset Selection Problem

15 years 2 months ago

Download pages.cs.wisc.edu

Christos Boutsidis, Michael W. Mahoney, Petros Dri...

claim paper

Read More »

Voted

STOC
2002
ACM

91views Algorithms» more STOC 2002»

The importance of being biased

16 years 3 months ago

Download www.cs.cmu.edu

The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...

Irit Dinur, Shmuel Safra

claim paper

Read More »

click to vote

STOC
2007
ACM

154views Algorithms» more STOC 2007»

Improved approximation for directed cut problems

16 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers