Skip to main content
SpringerLink
Log in

On Conditional Covering Problem

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The problem has a constraint that each vertex can cover only those vertices that lie within its covering radius and no vertex can cover itself. The objective of the problem is to find a set that minimizes the sum of the facility costs required to cover all the demand points. An algorithm for CCP on paths was presented by Horne and Smith (Networks 46(4):177–185, 2005). We show that their algorithm is wrong and further present a correct O(n 3) algorithm for the same. We also propose an O(n 2) algorithm for the CCP on paths when all vertices are assigned unit costs and further extend this algorithm to interval graphs without an increase in time complexity.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chaudhry S.S., Moon I.D., McCormick S.T.: Conditional covering: greedy heuristics and computational results. Comput. OR 14(1), 11–18 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Goldberg J.B., Lunday B.J., Smith J.C.: Algorithms for solving the conditional covering problem on paths. Naval Res. Logist. 52(4), 293–301 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Golumbic M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  4. Horne J.A., Smith J.C.: A dynamic programming algorithm for the conditional covering problem on tree graphs. Networks 46(4), 186–197 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Horne J.A., Smith J.C.: Dynamic programming algorithms for the conditional covering problem on path and extended star graphs. Networks 46(4), 177–185 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kratsch D.: Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math. 99(1–3), 111–123 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Moon I.D., Chaudhry S.S.: An analysis of network location problems with distance constraints. Manage. Sci. 30, 290–307 (1984)

    Article  MATH  Google Scholar 

  8. Moon I.D., Papayanopoulos L.: Facility location on a tree with maximum distance constraints. Comput. OR 22(9), 905–914 (1995)

    Article  MATH  Google Scholar 

  9. Pfaff J., Laskar R., Hedetniemi S.T.: Linear algorithms for independent domination and total domination in series-parallel graphs. Manage. Sci. 30, 290–307 (1984)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Department, University of Wisconsin Madison, Madison, WI, 53706, USA

    Balasubramanian Sivan

  2. Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, 600036, India

    S. Harini & C. Pandu Rangan

Authors
  1. Balasubramanian Sivan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Harini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Balasubramanian Sivan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sivan, B., Harini, S. & Pandu Rangan, C. On Conditional Covering Problem. Math.Comput.Sci. 3, 97–107 (2010). https://doi.org/10.1007/s11786-009-0001-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-009-0001-1

Keywords

Mathematics Subject Classification (2000)

Search

Navigation