On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems

Authors:
Chung-Lun Li;S.Thomas Mccormick;David Simchi-Levi
Affiliations:
John M. Olin School of Business, Washington University, St. Louis, MO, USA;Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, Canada;Department of Industrial Engineering and Operations Research, Columbia University, New York, USA
Venue:
Operations Research Letters
Year:
1992

Citing 2
Cited 7

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A simple heuristic for the p-centre problem

Operations Research Letters

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length

Theoretical Computer Science
Improved approximability and non-approximability results for graph diameter decreasing problems

Theoretical Computer Science
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph

Discrete Optimization
Augmenting forests to meet odd diameter requirements

Discrete Optimization
Note: The parametric complexity of graph diameter augmentation

Discrete Applied Mathematics
Augmenting outerplanar graphs to meet diameter requirements

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph G = (V, E), positive integer D