Skip to main content

A Facility Coloring Problem in 1-D

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8546))

Included in the following conference series:

  • 759 Accesses

Abstract

Consider a line segment R consisting of n facilities. Each facility is a point on R and it needs to be assigned exactly one of the colors from a given palette of c colors. At an instant of time only the facilities of one particular color are ‘active’ and all other facilities are ‘dormant’. For the set of facilities of a particular color, we compute the one dimensional Voronoi diagram, and find the cell, i.e, a segment of maximum length. The users are assumed to be uniformly distributed over R and they travel to the nearest among the facilities of that particular color that is active. Our objective is to assign colors to the facilities in such a way that the length of the longest cell is minimized. We solve this optimization problem for various values of n and c. We propose an optimal coloring scheme for the number of facilities n being a multiple of c as well as for the general case where n is not a multiple of c. When n is a multiple of c, we compute an optimal scheme in Θ(n) time. For the general case, we propose a coloring scheme that returns the optimal in O(n 2logn) time.

This research is partially supported by NSERC and the Commonwealth Scholarship Program of DFAIT, Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Funke, S., Kesselman, A., Kuhn, F., Lotker, Z., Segal, M.: Improved approximation algorithms for connected sensor cover. Wireless Networks 13(2), 153–164 (2007)

    Article  Google Scholar 

  2. Lin, Y., Zhang, J., Chung, H.S.-H., Ip, W.-H., Li, Y., Shi, Y.-H.: An Ant Colony Optimization Approach for Maximizing the Lifetime of Heterogeneous Wireless Sensor Networks. IEEE Transactions on Systems, Man, and Cybernetics, Part C 42(3), 408–420 (2012)

    Article  Google Scholar 

  3. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Wan, P.-J., Alzoubi, K.M.: Ophir Frieder: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. MONET 9(2), 141–149 (2004)

    Google Scholar 

  5. Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. TOSN 2(3), 444–453 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Das, S., Maheshwari, A., Nandy, A., Smid, M. (2014). A Facility Coloring Problem in 1-D. In: Gu, Q., Hell, P., Yang, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2014. Lecture Notes in Computer Science, vol 8546. Springer, Cham. https://doi.org/10.1007/978-3-319-07956-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07956-1_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07955-4

  • Online ISBN: 978-3-319-07956-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics