Pages that link to "Item:Q945943"
From MaRDI portal
The following pages link to Computing a minimum-dilation spanning tree is NP-hard (Q945943):
Displaying 16 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- Computing Minimum Dilation Spanning Trees in Geometric Graphs (Q3196394) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- (Q5092418) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
