Pages that link to "Item:Q3057531"
From MaRDI portal
The following pages link to The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (Q3057531):
Displaying 8 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← 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)
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)
