Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance

DOI10.1007/978-3-031-16081-3_30zbMath1527.90240OpenAlexW4296167513MaRDI QIDQ6111621

No author found.

Publication date: 7 July 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_30

zbMATH Keywords

partial inverse problemmin-max spanning treestrongly polynomial-time algorithmweighted bottleneck Hamming distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Partial inverse min-max spanning tree problem
• 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
• On an instance of the inverse shortest paths problem
• The Min-Max Spanning Tree Problem and some extensions
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• 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
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Unnamed Item

This page was built for publication: Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance