NDLI: Approximation Algorithms for Single-Source Unsplittable Flow

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Stein, Clifford Kolliopoulos, Stavros G.
Copyright Year	2002
Abstract	In the single-source unsplittable flow problem, we are given a network G, a source vertex s, and k commodities with sinks ti and real-valued demands $\rho_i,$ $1\leq i \leq k.$ We seek to route the demand $\rho_i$ of each commodity i along a single s-ti flow path so that the total flow routed across any edge e is bounded by the edge capacity ue. The conceptual difficulty of this NP-hard problem arises from combining packing constraints due to the existence of capacities with path selection in a graph of arbitrary topology. In this paper we give a generic framework, which yields approximation algorithms that are simpler than those previously known and achieve significant improvements upon the approximation ratios. Our framework, with appropriate subroutines, applies to all optimization versions previously considered and, unlike previous work, treats in a unified manner directed and undirected graphs. We provide extensions of our algorithms which yield the best possible approximation guarantees for restricted sets of demand values and an associated scheduling problem.
Starting Page	919
Ending Page	946
Page Count	28
File Format	PDF
ISSN	00975397
DOI	10.1137/S0097539799355314
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	3
Volume Number	31
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2001-01-01
Access Restriction	Subscribed
Subject Keyword	routing unsplittable flow Analysis of algorithms and problem complexity network flow parallel machine scheduling disjoint paths Network models, deterministic approximation algorithms Scheduling theory, deterministic network algorithms
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximation Techniques for Average Completion Time Scheduling

Scheduling Parallel Machines On-Line

Fast Algorithms for Bipartite Network Flow

Approximation algorithms for edge-disjoint paths and unsplittable flow (2006)

Implementing approximation algorithms for the single-source unsplittable flow problem

Approximation Techniques for Utilitarian Mechanism Design

Improved Approximation Algorithms for Shop Scheduling Problems

Single-source unsplittable flow

Stackelberg Scheduling Strategies

Approximation Algorithms for Single-Source Unsplittable Flow

Similar Documents

Approximation Techniques for Average Completion Time Scheduling

Scheduling Parallel Machines On-Line

Fast Algorithms for Bipartite Network Flow

Approximation algorithms for edge-disjoint paths and unsplittable flow (2006)

Implementing approximation algorithms for the single-source unsplittable flow problem

Approximation Techniques for Utilitarian Mechanism Design

Improved Approximation Algorithms for Shop Scheduling Problems

Single-source unsplittable flow

Stackelberg Scheduling Strategies

Approximation Algorithms for Single-Source Unsplittable Flow