Pages that link to "Item:Q5900926"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900926):
Displaying 18 items.
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- On the minimum diameter spanning tree problem (Q673823) (← links)
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- Primal dual based algorithm for degree-balanced spanning tree problem (Q1740242) (← links)
- Approximating the degree-bounded minimum diameter spanning tree problem (Q1763151) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking (Q1941696) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem (Q2942691) (← links)
- Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (Q3186835) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- (Q4286079) (← links)
- (Q4448919) (← links)