LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS
From MaRDI portal
Publication:3158891
DOI10.15807/jorsj.47.123zbMath1165.90661OpenAlexW1594608418MaRDI QIDQ3158891
Yuichiro Miyamoto, Tomomi Matsui
Publication date: 31 January 2005
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/140c3828b6b20ca879213835d852bcba45e5e76b
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS
