The geometric generalized minimum spanning tree problem with grid clustering

DOI10.1007/s10288-006-0012-6zbMath1115.68112OpenAlexW2100115208MaRDI QIDQ882648

Corinne Feremans, Alexander Grigoriev, R. A. Sitters

Publication date: 24 May 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0012-6

zbMATH Keywords

complexityapproximationsgeneralized minimum spanning treegrid clustering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (7)

Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ Approximation schemes for the generalized traveling salesman problem ⋮ Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters

Cites Work

• New models of the generalized minimum spanning tree problem
• Solving group Steiner problems as Steiner problems.
• Generalized network design problems.
• On the generalized minimum spanning tree problem
• On generalized minimum spanning trees
• Unnamed Item
• Unnamed Item

This page was built for publication: The geometric generalized minimum spanning tree problem with grid clustering