Clustered spanning tree -- conditions for feasibility

MaRDI QIDQ5207831zbMATH OpenFDO

Authors Nili Guttmann-Beck, Zeev Sorek, Michal Stern

Publication date 13 January 2020

Full work available at URL https://dmtcs.episciences.org/5710/pdf

zbMATH Keywords

clustered spanning treefeasibility

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Vertices removal for feasibility of clustered spanning trees
• On the minimum routing cost clustered tree problem
• The clustering matroid and the optimal clustering tree
• On the clustered Steiner tree problem
• The complete optimal stars-clustering-tree problem

Cited in

(5)

• Vertices removal for feasibility of clustered spanning trees
• Achieving feasibility for clustered traveling salesman problems using PQ‐trees
• Decomposing the feasibility of clustered spanning tree by paths
• Insertion and removal lists gaining clustered subtrees
• On the complexity of community-aware network sparsification

This page was built for publication: Clustered spanning tree -- conditions for feasibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207831)