Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
From MaRDI portal
Publication:6181336
DOI10.1007/s10878-023-01093-8MaRDI QIDQ6181336
No author found.
Publication date: 22 January 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
partial inverse problemmin-max spanning treestrongly polynomial-time algorithmweighted bottleneck Hamming distance
Cites Work
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Partial inverse min-max spanning tree problem
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- The Min-Max Spanning Tree Problem and some extensions
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- 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
- 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
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Partial inverse assignment problems under \(l_{1}\) norm
- Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- The partial inverse minimum cut problem withL1-norm is strongly NP-hard
- Computational Difficulties of Bilevel Linear Programming
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- An algorithm for inverse minimum spanning tree problem
- A Faster Algorithm for the Inverse Spanning Tree Problem
This page was built for publication: Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
