Line system design and a generalized coloring problem

DOI10.1007/B13632MaRDI QIDQ5897231zbMATH OpenOpenAlexFDO

Authors Mansoor Alicherry, Randeep Bhatia

Publication date 3 March 2010

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

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2079419
• Routing and path multicoloring
• An approximation algorithm for circular arc colouring
• scientific article; zbMATH DE number 1182769
• STACS 2004

Cited in

(5)

• LP rounding and combinatorial algorithms for minimizing active and busy time
• Active and busy time scheduling problem: a survey
• Complexity and online algorithms for minimum skyline coloring of intervals
• Online flexible busy time scheduling on heterogeneous machines
• Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing

This page was built for publication: Line system design and a generalized coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897231)