Exploiting a hypergraph model for finding golomb rulers

Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Golomb rulers are special rulers where for any two marks it holds that the distance between them is unique. They find applications in positioning of radio channels, radio astronomy, communication networks, and bioinformatics. An important subproblem in constructing "compact" Golomb rulers is Golomb Subruler (GSR), which asks whether it is possible to make a given ruler Golomb by removing at most k marks. We initiate a study of GSR from a parameterized complexity perspective. In particular, we develop a hypergraph characterization of rulers and consider the construction and structure of the corresponding hypergraphs. We exploit their properties to derive polynomial-time data reduction rules that lead to a problem kernel for GSR with O(k 3) marks. Finally, we provide a simplified NP-hardness construction for GSR.

Original languageEnglish
Title of host publicationCombinatorial Optimization - Second International Symposium, ISCO 2012, Revised Selected Papers
Number of pages12
StatePublished - 27 Aug 2012
Externally publishedYes
Event2nd International Symposium on Combinatorial Optimization, ISCO 2012 - Athens, Greece
Duration: 19 Apr 201221 Apr 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7422 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Symposium on Combinatorial Optimization, ISCO 2012


  • Data Reduction
  • Forbidden Subgraph Characterization
  • Hitting Set
  • NP-Hardness
  • Parameterized Complexity
  • Problem Kernel

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Exploiting a hypergraph model for finding golomb rulers'. Together they form a unique fingerprint.

Cite this