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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial optimization Ročník 27; číslo 1; s. 152 - 163
Hlavní autori:	Li, Jianping, Li, Weidong, Lichen, Junran
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.01.2014
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!