The subdivision-constrained routing requests problem

We are given a digraph D =( V , A ; w ), a length (delay) function w : A → R + , a positive integer d and a set of k requests, where s i ∈ V is called as the i th source node, t i ∈ V is called the i th sink node and B i is called as the i th length constraint. For a given positive integer d , the s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization Jg. 27; H. 1; S. 152 - 163
Hauptverfasser:	Li, Jianping, Li, Weidong, Lichen, Junran
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.01.2014
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation hardness Approximation algorithms Subdivision Strongly polynomial-time algorithms Inapproximability
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!