A note on upgrading the min–max weight of a base of a matroid

DOI10.14495/jsiaml.16.1OpenAlexW4390843848MaRDI QIDQ6125977

Unnamed Author, Kenjiro Takazawa

Publication date: 9 April 2024

Published in: JSIAM Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14495/jsiaml.16.1

zbMATH Keywords

algorithmmatroidminimum spanning treemin-max spanning treecycle property

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• The Min-Max Spanning Tree Problem and some extensions
• Upgrading min-max spanning tree problem under various cost functions

This page was built for publication: A note on upgrading the min–max weight of a base of a matroid