Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 458-467
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Computing a Diameter-Constrained Minimum Spanning Tree in ParallelLecture Notes in Computer Science, 2000
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- The boolean quadric polytope: Some characteristics, facets and relativesMathematical Programming, 1989
- A tree-based algorithm for distributed mutual exclusionACM Transactions on Computer Systems, 1989
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960