Complexity and Online Algorithms for a Coloring Problem on a Line



Wong, PW ORCID: 0000-0001-7935-7245 and Liu, H
(2017) Complexity and Online Algorithms for a Coloring Problem on a Line. In: The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2017-06-12 - 2017-06-16.

[img] Text
MAPSP_2017_paper_65.pdf - Submitted Version

Download (240kB)
Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 30 Aug 2017 08:53
Last Modified: 29 Sep 2020 08:20
URI: http://livrepository.liverpool.ac.uk/id/eprint/3009206