IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v146y2006i1p105-11710.1007-s10479-006-0045-4.html
   My bibliography  Save this article

Experiments on data reduction for optimal domination in networks

Author

Listed:
  • Jochen Alber
  • Nadja Betzler
  • Rolf Niedermeier

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

Suggested Citation

  • Jochen Alber & Nadja Betzler & Rolf Niedermeier, 2006. "Experiments on data reduction for optimal domination in networks," Annals of Operations Research, Springer, vol. 146(1), pages 105-117, September.
    • Handle: RePEc:spr:annopr:v:146:y:2006:i:1:p:105-117:10.1007/s10479-006-0045-4
    DOI: 10.1007/s10479-006-0045-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0045-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0045-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gramm, Jens & Guo, Jiong & Huffner, Falk & Niedermeier, Rolf & Piepho, Hans-Peter & Schmid, Ramona, 2007. "Algorithms for compact letter displays: Comparison and evaluation," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 725-736, October.
    2. Matthias Bentert & René van Bevern & André Nichterlein & Rolf Niedermeier & Pavel V. Smirnov, 2022. "Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 55-75, January.
    3. Marjan Marzban & Qian-Ping Gu & Xiaohua Jia, 2016. "New analysis and computational study for the planar connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 198-225, July.
    4. Rim Wersch & Steven Kelk & Simone Linz & Georgios Stamoulis, 2022. "Reflections on kernelizing and computing unrooted agreement forests," Annals of Operations Research, Springer, vol. 309(1), pages 425-451, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:146:y:2006:i:1:p:105-117:10.1007/s10479-006-0045-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.