A Faster Algorithm for the Inverse Spanning Tree Problem
From MaRDI portal
Publication:4943075
Recommendations
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Solving inverse spanning tree problems through network flow techniques
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- An algorithm for inverse minimum spanning tree problem
- scientific article; zbMATH DE number 949659
Cited in
(27)- Inverse optimization for linearly constrained convex separable programming problems
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Weighted inverse minimum spanning tree problems under Hamming distance
- On inverse traveling salesman problems
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l_ norm
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Some inverse optimization problems under the Hamming distance
- Solving inverse spanning tree problems through network flow techniques
- Complexity of some inverse shortest path lengths problems
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- An algorithm for inverse minimum spanning tree problem
- Notes on inverse bin-packing problems
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Solving a class of inverse semidefinite quadratic programming problem
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted l₁ norm
- Data-driven inverse optimization with imperfect information
- Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
- Partial inverse min-max spanning tree problem
- Inverse minimum flow problem
This page was built for publication: A Faster Algorithm for the Inverse Spanning Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943075)
