An efficient characterization of submodular spanning tree games
From MaRDI portal
Publication:5919387
DOI10.1007/978-3-030-17953-3_21zbMath1436.91007arXiv1906.02642OpenAlexW3082765757MaRDI QIDQ5919387
Publication date: 6 February 2020
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.02642
This page was built for publication: An efficient characterization of submodular spanning tree games