2714 search results - page 29 / 543 » Approximation Schemes for Scheduling |
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract—We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link...
100
Voted
RECOMB
2006
Springer
16 years 21 days ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
103
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
130
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
125
click to vote
ALGORITHMICA
1998
15 years 3 days ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...