Abstract
Abstract We consider a track assignment problem in a train depot leading to an online bounded coloring problem on permutation graphs or on overlap graphs. For permutation graphs we study the competitiveness of a First Fit-based algorithm and we show it matches the competitive ratio of the problem. For overlap graphs, even the unbounded case does not admit a constant competitive ratio.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
