A Facility Coloring Problem in 1-D

DOI10.1007/978-3-319-07956-1_9MaRDI QIDQ5251636zbMATH OpenOpenAlexFDO

Authors Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel Smid

Publication date 20 May 2015

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07956-1_9

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Recommendations

• A structure of 1-planar graph and its applications to coloring problems
• The \(a\)-graph coloring problem
• On total colorings of 1-planar graphs
• A note on total colorings of 1-planar graphs
• A solution to a colouring problem of P. Erdős
• On some coloring problems in grids
• A polyhedral approach for graph coloring
• An Exact Approach to the One-Dimensional Facility Layout Problem
• Publication:4936748
• Acyclic colouring of 1-planar graphs

Cited in

(1)

• scientific article; zbMATH DE number 1735785 (Why is no real title available?)

This page was built for publication: A Facility Coloring Problem in 1-D

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