Pages that link to "Item:Q1428068"
From MaRDI portal
The following pages link to Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068):
Displaying 6 items.
- The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
