Approximation algorithms for disjoint paths problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Main Author: | Kleinberg, Jon M |
---|---|
Other Authors: | Michel X. Goemans. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/11013 |
Similar Items
-
On-line algorithms for robot navigation and server problems
by: Kleinberg, Jon M
Published: (2007) -
Length 3 Edge-Disjoint Paths Is NP-Hard
by: Alpert, Hannah, et al.
Published: (2017) -
On-Line Algorithms for Robot Navigation and Server Problems
by: Kleinberg, Jon M.
Published: (2023) -
Approximation algorithms for stochastic scheduling problems
by: Dean, Brian C. (Brian Christopher), 1975-
Published: (2006) -
Edge disjoint spanning trees and failure recovery in data communication networks
by: Roskind, James Anthony
Published: (2005)