The maximum beer flow problem

DOI10.1016/J.TCS.2026.115768MaRDI QIDQ6851439zbMATH OpenFDO

Authors Wing-Kai Hon, Yujia Huang, Wang-Yang Li

Publication date 27 February 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115768

zbMATH Keywords

approximationbeer flowbeer pathNP-hardness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• On the Complexity of Timetable and Multicommodity Flow Problems
• Shortest beer path queries based on graph decomposition
• Shortest beer path queries in digraphs with bounded treewidth
• Shortest beer path queries in interval graphs
• Shortest beer path queries in outerplanar graphs

This page was built for publication: The maximum beer flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851439)