Modifying edges of a network to obtain short subgraphs

Authors:
Kay U. Drangmeister;Sven O. Krumke;Madhav V. Marathe;Hartmut Noltemeier;S. S. Ravi
Affiliations:
Univ. of Würzburg, Würzburg, Germany;Univ. of Würzburg, Würzburg, Germany;Los Alamos National Lab, Los Alamos, NM;Univ. of Würzburg, Würzburg, Germany;State Univ. of New York, Albany
Venue:
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Year:
1998

Citing 0
Cited 5

Network design and improvement

ACM Computing Surveys (CSUR)
Optimizing Cost Flows by Modifying Arc Costs and Capacities

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
The non-approximability of bicriteria network design problems

Journal of Discrete Algorithms
Efficient algorithms for robustness in resource allocation and scheduling problems

Theoretical Computer Science
Reverse 2-median problem on trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract