Minimum cost source location problem with vertex-connectivity requirements in digraphs

Information Processing Letters

Volumn 80, Issue 6, 2001, Pages 287-293

  Nagamochi, H ^a   Ishii, T ^a   Ito, H ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

Digraphs; Graph algorithms; Location problem; Matroids; Vertex connectivity

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

POLYNOMIAL TIME ALGORITHMS;

GRAPH THEORY;

EID: 0035980875     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00183-1     Document Type: Article

References (15)

1. Locating sources to meet flow demands in undirected networks
2. Matroids, submodular functions, and certain polyhedra
3. Network flow and testing graph connectivity
4. A weighted matroid intersection algorithm
5. On sparse subgraphs preserving connectivity properties
6. Computing vertex connectivity: New bounds from old techniques
7. An algorithm for finding a node-subset having high connectivity from other nodes
8. Edge connectivity between nodes and node-subsets
9. A faster and flexible algorithm for a location problem on undirected flow networks
10. Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets
11. Location on networks
12. Matroid intersection algorithms
13. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph
14. Location problems on undirected flow networks
15. Plural cover problem on undirected flow networks