Pages that link to "Item:Q4943075"
From MaRDI portal
The following pages link to A Faster Algorithm for the Inverse Spanning Tree Problem (Q4943075):
Displaying 26 items.
- Notes on inverse bin-packing problems (Q458387) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Data-driven inverse optimization with imperfect information (Q681497) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Inverse minimum flow problem (Q874337) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2022333) (← links)
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm (Q2088862) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- Solving inverse spanning tree problems through network flow techniques (Q2770110) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- Efficient Algorithms for the Inverse Spanning-Tree Problem (Q3637389) (← links)
- An algorithm for inverse minimum spanning tree problem (Q4378113) (← links)
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm (Q6582067) (← links)
