Pages that link to "Item:Q876503"
From MaRDI portal
The following pages link to Complexity of the minimum-length corridor problem (Q876503):
Displaying 4 items.
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- THE MINIMUM GUARDING TREE PROBLEM (Q5411806) (← links)