Sciweavers

80 search results - page 5 / 16

» stoc 2007

93

STOC
2007
ACM

93views Algorithms» more STOC 2007»

Degree-constrained network flows

16 years 6 months ago

Degree-constrained network flows

Download www.math.mcgill.ca

P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordo...

claim paper

Read More »

127

STOC
2007
ACM

71views Algorithms» more STOC 2007»

Survivable network design with degree or order constraints

16 years 6 months ago

Survivable network design with degree or order constraints

Download www.andrew.cmu.edu

Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour...

claim paper

Read More »

123

STOC
2007
ACM

83views Algorithms» more STOC 2007»

Verifying and decoding in constant depth

16 years 6 months ago

Verifying and decoding in constant depth

Download www.alexhealy.net

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...

claim paper

Read More »

133

STOC
2007
ACM

104views Algorithms» more STOC 2007»

Simple deterministic approximation algorithms for counting matchings

16 years 6 months ago

Simple deterministic approximation algorithms for counting matchings

Download simula.stanford.edu

Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C...

claim paper

Read More »

114

STOC
2007
ACM

94views Algorithms» more STOC 2007»

Sampling-based dimension reduction for subspace approximation

16 years 6 months ago

Sampling-based dimension reduction for subspace approximation

Download www.cs.uiowa.edu

We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th

Amit Deshpande, Kasturi R. Varadarajan

claim paper

Read More »

« Prev « First page 5 / 16 Last » Next »