2714 search results - page 231 / 543 » Approximation Schemes for Scheduling |
152
click to vote
INFOCOM
1997
IEEE
15 years 8 months ago
1997
IEEE
We propose a
ow-control scheme that combines the merits of credit- and rate-based
ow-control schemes by applying direct control over both bandwidth and bu er resources. The goal...
156
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
130
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
151
Voted
SCALESPACE
2009
Springer
15 years 11 months ago
2009
Springer
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
153
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...