The following pages link to (Q4952700):
Displaying 7 items.
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- The transitive minimum Manhattan subnetwork problem in 3 dimensions (Q968145) (← links)
- Polynomial time approximation scheme for the rectilinear Steiner arborescence problem (Q1587590) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)