Sciweavers

192 search results - page 7 / 39
» A Constant-Factor Approximation Algorithm for the Multicommo...
Sort
View
FOCS
2007
IEEE
15 years 6 months ago
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
Anna Gál, Parikshit Gopalan
ESA
2003
Springer
110views Algorithms» more  ESA 2003»
15 years 5 months ago
Multicommodity Flow Approximation Used for Exact Graph Partitioning
Meinolf Sellmann, Norbert Sensen, Larissa Timajev