Sciweavers

4 search results - page 1 / 1
» Faster Approximate Lossy Generalized Flow via Interior Point...
Sort
View
6
Voted
CORR
2008
Springer
55views Education» more  CORR 2008»
13 years 5 months ago
Faster Approximate Lossy Generalized Flow via Interior Point Algorithms
Samuel I. Daitch, Daniel A. Spielman
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
13 years 9 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
VC
1998
66views more  VC 1998»
13 years 5 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet
NGC
2000
Springer
114views Communications» more  NGC 2000»
13 years 9 months ago
FLID-DL
Abstract--We describe fair layered increase/decrease with dynamic layering (FLID-DL): a new multirate congestion control algorithm for layered multicast sessions. FLID-DL generaliz...
John W. Byers, Michael Frumin, Gavin B. Horn, Mich...