Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
Annual Symposium on Foundations of Computer Science - Proceedings
Saved in:
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 |
Similar Items
-
Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems
by: Srinivasan, Aravind
Published: (2014) -
An improved approximation algorithm for the s-t path movement problem
by: Wattana Jindaluang, et al.
Published: (2018) -
An improved approximation algorithm for the s-t path movement problem
by: Wattana Jindaluang, et al.
Published: (2018) -
An improved approximation algorithm for the s-t path movement problem
by: Jindaluang W., et al.
Published: (2017) -
An Improved Approximation Algorithm for the s-t Path Movement Problem
by: Wattana Jindaluang, et al.
Published: (2019)