Pages that link to "Item:Q2176281"
From MaRDI portal
The following pages link to Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281):
Displayed 6 items.
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- Partial inverse maximum spanning tree problem under the Chebyshev norm (Q2091101) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm (Q2150566) (← links)
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6111621) (← links)
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)