On the minimum routing cost clustered tree problem
From MaRDI portal
Publication:2359809
DOI10.1007/s10878-016-0026-8zbMath1372.90096OpenAlexW2373493542MaRDI QIDQ2359809
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0026-8
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem ⋮ Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs ⋮ The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An improved approximation algorithm for the clustered traveling salesman problem
- Finding best swap edges minimizing the routing cost of a spanning tree
- A two-patch model for the optimal management of a fishing resource considering a marine protected area
- The checkpoint problem
- On the intercluster distance of a tree metric
- A linear-time algorithm to compute a MAD tree of an interval graph
- Approximation algorithms for the shortest total path length spanning tree problem
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Generalized network design problems.
- On the clustered Steiner tree problem
- The swap edges of a multiple-sources routing tree
- Worst-Case Analysis of Network Design Problem Heuristics
- Spanning Trees and Optimization Problems
- Light graphs with small routing cost
- Exact algorithms for minimum routing cost trees
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
- PTAS’s for Some Metric p-source Communication Spanning Tree Problems
- Approximation algorithms for somek-source shortest paths spanning tree problems
- Distributed Approximation of Minimum Routing Cost Trees
This page was built for publication: On the minimum routing cost clustered tree problem
