On the Single-Source Unsplittable Flow Problem

被引：0
|
作者：
Yefim Dinitz
Naveen Garg
Michel X. Goemans
机构：
[1] Department of Computer Science,
[2] Ben-Gurion University of the Negev; Beer-Sheva,undefined
[3] Israel; E-mail: dinitz@cs.bgu.ac.il,undefined
[4] Department of Computer Science and Engineering,undefined
[5] Indian Institute of Technology; New Delhi; E-mail: naveen@cse.iitd.ernet.in,undefined
[6] CORE; 34 Voie du Roman Pays,undefined
[7] B-1348 Louvain-La-Neuve,undefined
[8] Belgium; E-mail: goemans@core.ucl.ac.be,undefined
来源：
Combinatorica | 1999年 / 19卷
关键词：
AMS Subject Classification (1991) Classes:  90B10, 90C35, 05C38, 05C85;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
be a capacitated directed graph with a source s and k terminals \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document} with demands \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}. We would like to concurrently route every demand on a single path from s to the corresponding terminal without violating the capacities. There are several interesting and important variations of this unsplittable flow problem.
引用
收藏
页码：17 / 41
页数：24
相关论文
共 50 条
12345