Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems

Annual Symposium on Foundations of Computer Science - Proceedings

Saved in:
Bibliographic Details
Main Author: Srinivasan, Aravind
Other Authors: INFORMATION SYSTEMS & COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2014
Online Access:http://scholarbank.nus.edu.sg/handle/10635/99534
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-99534
record_format dspace
spelling sg-nus-scholar.10635-995342015-02-25T10:54:15Z Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems Srinivasan, Aravind INFORMATION SYSTEMS & COMPUTER SCIENCE Annual Symposium on Foundations of Computer Science - Proceedings 416-425 ASFPD 2014-10-27T06:05:05Z 2014-10-27T06:05:05Z 1997 Conference Paper Srinivasan, Aravind (1997). Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. Annual Symposium on Foundations of Computer Science - Proceedings : 416-425. ScholarBank@NUS Repository. 02725428 http://scholarbank.nus.edu.sg/handle/10635/99534 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
country Singapore
collection ScholarBank@NUS
description Annual Symposium on Foundations of Computer Science - Proceedings
author2 INFORMATION SYSTEMS & COMPUTER SCIENCE
author_facet INFORMATION SYSTEMS & COMPUTER SCIENCE
Srinivasan, Aravind
format Conference or Workshop Item
author Srinivasan, Aravind
spellingShingle Srinivasan, Aravind
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
author_sort Srinivasan, Aravind
title Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
title_short Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
title_full Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
title_fullStr Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
title_full_unstemmed Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
title_sort improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/99534
_version_ 1681092207313944576