Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets

DOI10.1007/3-540-40996-3_29MaRDI QIDQ4472509zbMATH OpenFDO

Authors Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690338.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)

Recommendations

• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Edge connectivity between nodes and node-subsets
• Minimum cost source location problems with flow requirements
• Approximating node connectivity problems via set covers
• Minimum cost source location problem with local 3-vertex-connectivity requirements

Cited in

(7)

• A unifying location model on tree graphs based on submodularity property
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• The source location problem with local 3-vertex-connectivity requirements
• The root location problem for arc-disjoint arborescences
• Edge connectivity between nodes and node-subsets
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Static and dynamic source locations in undirected networks

This page was built for publication: Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472509)