Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14730
For citation please use:
Main Title: Approximating the single source unsplittable min-cost flow problem
Author(s): Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15957
http://dx.doi.org/10.14279/depositonce-14730
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path and the total cost must not exceed a given budget. This problem has been introduced by Kleinberg and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing and virtual-circuit routing.
Subject(s): approximation algorithms
graph algorithms
network flow
routing
Issue Date: 2000
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
90B10 Network models, deterministic
90C35 Programming involving graphs or networks
05C38 Paths and cycles
05C85 Graph algorithms
90C59 Approximation methods and heuristics
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2000, 685
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-685-2000.pdf
Format: Adobe PDF | Size: 207.39 kB
DownloadShow Preview
Thumbnail
Report-685-2000.ps.gz
Format: Unknown | Size: 82.76 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.