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

Full description

Bibliographic Details

Published in:	Journal of combinatorial optimization Vol. 27; no. 1; pp. 152 - 163
Main Authors:	Li, Jianping, Li, Weidong, Lichen, Junran
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.01.2014
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!