Maximum Covering Formulation for Open Locating Dominating Sets

Blair Sweigart () and Rex Kincaid ()
Additional contact information
Blair Sweigart: College of William & Mary
Rex Kincaid: College of William & Mary

A chapter in Operations Research Proceedings 2016, 2018, pp 259-264 from Springer

Abstract: Abstract As a result of specific constructs and features, many graphs do not admit OLD-sets. We extend the traditional OLD-set definition by relaxing the dominating property. Instead of requiring all nodes to be covered by an OLD-set, we seek what we call a maximum covering OLD-set. Every graph has a maximum covering OLD-set. Furthermore, maximum covering OLD-sets allow an exploration of the tradeoff between the number of sensors placed and the number of nodes covered.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-55702-1_35

Ordering information: This item can be ordered from
http://www.springer.com/9783319557021

DOI: 10.1007/978-3-319-55702-1_35

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().