Experiments on data reduction for optimal domination in networks

Jochen Alber (), Nadja Betzler () and Rolf Niedermeier ()

Annals of Operations Research, 2006, vol. 146, issue 1, 105-117

Abstract: We present empirical results on computing optimal dominating sets in networks by means of data reduction through efficient preprocessing rules. Thus, we demonstrate the usefulness of so far only theoretically considered data reduction techniques for practically solving one of the most important network problems in combinatorial optimization. Copyright Springer Science+Business Media, LLC 2006

Keywords: Experimental study; Domination; NP-complete problem; Preprocessing by data reduction rules; Optimal solutions; Network optimization (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-0045-4 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:146:y:2006:i:1:p:105-117:10.1007/s10479-006-0045-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-0045-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

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