Search Sciweavers | Sciweavers

3875 search results - page 44 / 775

» Approximation algorithms for the 0-extension problem

click to vote

STOC
2007
ACM

154views Algorithms» more STOC 2007»

Improved approximation for directed cut problems

15 years 10 months ago

Download www.math.tau.ac.il

Amit Agarwal, Noga Alon, Moses Charikar

claim paper

Read More »

click to vote

INFOCOM
2011
IEEE

194views Communications» more INFOCOM 2011»

Approximation algorithms for throughput maximization in wireless networks with delay constraints

14 years 1 months ago

Download www.cs.umd.edu

—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...

Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthas...

claim paper

Read More »

click to vote

WADS
2005
Springer

88views Algorithms» more WADS 2005»

Approximating the Online Set Multicover Problems via Randomized Winnowing

15 years 3 months ago

Download www.cs.uic.edu

Piotr Berman, Bhaskar DasGupta

claim paper

Read More »

click to vote

ISAAC
2001
Springer

99views Algorithms» more ISAAC 2001»

Tree-Approximations for the Weighted Cost-Distance Problem

15 years 2 months ago

Download cone.informatik.uni-freiburg.de

Christian Schindelhauer, Birgitta Weber

claim paper

Read More »

Voted

STOC
1989
ACM

66views Algorithms» more STOC 1989»

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

15 years 1 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers