Pages that link to "Item:Q3479805"
From MaRDI portal
The following pages link to A minimum-length covering subtree of a tree (Q3479805):
Displaying 10 items.
- A minimum length covering subgraph of a network (Q920001) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Efficient solution methods for covering tree problems (Q1284598) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Comments on: ``Extensive facility location problems on networks: an updated review'' (Q1667395) (← links)
- The maximum utilization subtree problem (Q1872019) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- Indirect covering tree problems on spanning tree networks (Q2368291) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- On the location of a tree-shaped facility (Q5689811) (← links)
