login
Menu
Search
Submit
Browse Collections
About
login
Approximation Algorithms and Hardness of Routing on Disjoint Paths
Kim, Hong Kyun
2018
Download
Formats
Format
BibTeX
View
Download
MARCXML
View
Download
TextMARC
View
Download
MARC
View
Download
DataCite
View
Download
DublinCore
View
Download
EndNote
View
Download
NLM
View
Download
RefWorks
View
Download
RIS
View
Download
Add to Basket
Files
Details
Title
Approximation Algorithms and Hardness of Routing on Disjoint Paths
Author
Kim, Hong Kyun : University of Chicago
Degree Type
Ph.D.
Content Type
Dissertation
Academic Advisor
Julia Chuzhoy
Keywords
Approximation algorithms
;
Edge-Disjoint paths
;
Hardness of approximation
;
Node-Disjoint paths
;
Routing problems
Digital Object Identifier
https://doi.org/10.6082/q0ep-6829
Publication Date
2018
Language
English
Licensing
University of Chicago dissertations are covered by copyright.
Record Appears in
Physical Sciences Division
>
Computer Science
All
Record Created
2018-08-09
Actions
PDF
Statistics
Downloads
Unique Downloads
Views
Unique Views
from
to
By Days
By Months
By Years
Update
Export
Download Full History