Sciweavers

626 search results - page 55 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
INFOCOM
2000
IEEE
14 years 2 months ago
CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation
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...
Rong Pan, Balaji Prabhakar, Konstantinos Psounis
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 3 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
ESA
2008
Springer
100views Algorithms» more  ESA 2008»
13 years 11 months ago
Improved Approximation Algorithms for Relay Placement
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
Alon Efrat, Sándor P. Fekete, Poornananda R...