The Structure and Number of Global Roundings of a Graph

DOI10.1007/3-540-45071-8_15zbMath1276.05109OpenAlexW3156814272MaRDI QIDQ3082920

Naoki Katoh, Takeshi Tokuyama, Tetsuo Asano, Hisao Tamaki

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_15

zbMATH Keywords

hypergraphshortest pathsaffine independent setbinary assignmentglobal roundingreal assignment

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Combinatorics and algorithms for low-discrepancy roundings of a real sequence

This page was built for publication: The Structure and Number of Global Roundings of a Graph