A strongly polynomial algorithm for the inverse shortest arborescence problem

DOI10.1016/S0166-218X(97)86750-9zbMath0897.90188OpenAlexW1570195365MaRDI QIDQ1383373

Zhenhong Liu, Zhi-quan Hu

Publication date: 5 October 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

inverse problemweighted shortest arborescence problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A simple algorithm and min-max formula for the inverse arborescence problem ⋮ The base-matroid and inverse combinatorial optimization problems. ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Inverse optimization problems with multiple weight functions

Cites Work

• On an instance of the inverse shortest paths problem
• An inverse problem of the weighted shortest path problem
• Optimum branchings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A strongly polynomial algorithm for the inverse shortest arborescence problem