Approximation algorithms for capacitated partial inverse maximum spanning tree problem
From MaRDI portal
Publication:2176281
Recommendations
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Partial inverse min-max spanning tree problem
- Partial inverse maximum spanning tree problem under the Chebyshev norm
- The partial inverse minimum spanning tree problem when weight increase is forbidden
Cites work
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- An algorithm for inverse minimum spanning tree problem
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
- Complexity of partial inverse assignment problem and partial inverse cut problem
- Computational Difficulties of Bilevel Linear Programming
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Graph theory
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- Minimizing a Convex Cost Closure Set
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Partial inverse assignment problems under \(l_{1}\) norm
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Solving inverse spanning tree problems through network flow techniques
- The base-matroid and inverse combinatorial optimization problems.
- The partial inverse minimum cut problem with \(L_1\)-norm is strongly NP-hard
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Weighted inverse minimum spanning tree problems under Hamming distance
Cited in
(9)- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- Partial inverse maximum spanning tree problem under the Chebyshev norm
This page was built for publication: Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176281)
