The complete optimal stars-clustering-tree problem

DOI10.1016/j.dam.2006.12.004zbMath1165.90610OpenAlexW2048682560MaRDI QIDQ2473041

Michal Stern, Ephraim Korach

Publication date: 26 February 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.12.004

zbMATH Keywords

starscombinatorial optimizationhypergraphsNP-hardnessclustering spanning treespolynomial graph algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items (6)

Approximation Algorithms for Not Necessarily Disjoint Clustered TSP ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ On the approximability and hardness of minimum topic connected overlay and its special instances ⋮ Network construction with subgraph connectivity constraints ⋮ Equal-need sharing of a network under connectivity constraints ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The clustering matroid and the optimal clustering tree
• Algorithmic graph theory and perfect graphs
• Topics in Intersection Graph Theory
• On the Consecutive-Retrieval Problem

This page was built for publication: The complete optimal stars-clustering-tree problem