An Approximation Algorithm for the Bipartite Traveling Tournament Problem
From MaRDI portal
Publication:5169687
DOI10.1287/moor.2013.0597zbMath1291.90094OpenAlexW1971938577MaRDI QIDQ5169687
Richard Hoshino, Ken-ichi Kawarabayashi
Publication date: 11 July 2014
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2013.0597
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (2)
Uniform-scale assessment of role minimization in bipartite networks and its application to access control ⋮ A further improvement on approximating TTP-2
This page was built for publication: An Approximation Algorithm for the Bipartite Traveling Tournament Problem
