Pages that link to "Item:Q2359809"
From MaRDI portal
The following pages link to On the minimum routing cost clustered tree problem (Q2359809):
Displaying 9 items.
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem (Q2123564) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
- Minimum weight clustered dominating tree problem (Q6109249) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)