Hardness of approximation for vertex-connectivity network design problems
- Guy Kortsarz
- Robert Krauthgamer
- et al.
- 2004
- SIAM Journal on Computing
Publications
Date
Featured collections
Popular topics
123 results at SIAM Journal on Computing
Strict polynomial-time in simulation and extraction
- Boaz Barak
- Yehuda Lindell
- 2004
- SIAM Journal on Computing
Stability of adaptive and nonadaptive packet routing policies in adversarial queueing networks
- David Gamarnik
- 2003
- SIAM Journal on Computing
Improved approximations of crossings in graph drawings and VLSI layout areas
- Guy Even
- Sudipto Guha
- et al.
- 2003
- SIAM Journal on Computing
Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds
- Ran Canetti
- Joe Kilian
- et al.
- 2003
- SIAM Journal on Computing
Approximating the throughput of multiple machines in real-time scheduling
- Amotz Bar-Noy
- Sudipto Guha
- et al.
- 2001
- SIAM Journal on Computing
Checking approximate computations of polynomials and functional equations
- Funda Ergün
- S. Ravi Kumar
- et al.
- 2001
- SIAM Journal on Computing
Tight fault locality
- S. Kutten
- David Peleg
- 2000
- SIAM Journal on Computing
Gadgets, approximation, and linear programming
- Luca Trevisan
- Gregory B. Sorkin
- et al.
- 2000
- SIAM Journal on Computing
The angular-metric traveling salesman problem
- Alok Aggarwal
- Don Coppersmith
- et al.
- 2000
- SIAM Journal on Computing