Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
From MaRDI portal
Publication:2279743
Recommendations
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Inverse constrained minimum spanning tree problem under Hamming distance
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
- Weighted inverse minimum spanning tree problems under Hamming distance
- Inverse cost limit of constrained minimum spanning tree problem under Hamming distance
Cites work
- A Faster Algorithm for the Inverse Spanning Tree Problem
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
- 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 o(n^3 )-Time Maximum-Flow Algorithm
- An algorithm for inverse minimum spanning tree problem
- Complexity of partial inverse assignment problem and partial inverse cut problem
- 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
- Heuristic algorithms for the inverse mixed integer linear programming problem
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Inverse maximum flow problems under the weighted Hamming distance
- 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
- Max flows in O(nm) time, or better
- Minimizing a Convex Cost Closure Set
- 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 center location improvement problem under the Hamming distance
- The Complexity of Multiterminal Cuts
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The partial inverse minimum cut problem with L₁-norm is strongly NP-hard
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- The shortest path improvement problems under Hamming distance
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Weighted inverse minimum cut problem under the sum-type Hamming distance
- Weighted inverse minimum spanning tree problems under Hamming distance
Cited in
(13)- Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm
- Weighted inverse minimum spanning tree problems under Hamming distance
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck 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
- Expanding maximum capacity path under weighted sum-type distances
- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Inverse cost limit of constrained minimum spanning tree problem under Hamming distance
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- 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₁ norm
This page was built for publication: Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279743)
