## Abstract

Golomb rulers are special rulers where for any two marks it holds that the distance between them is unique. They find applications in radio frequency selection, radio astronomy, data encryption, 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 consider a natural hypergraph characterization of rulers and investigate the construction and structure of the corresponding hypergraphs. We exploit their properties to derive polynomial-time data reduction rules that reduce a given instance of GSR to an equivalent one with O(k^{3}) marks. Finally, we complement a recent computational complexity study of GSR by providing a simplified reduction that shows NP-hardness even when all integers are bounded by a polynomial in the input length.

Original language | English |
---|---|

Pages (from-to) | 449-471 |

Number of pages | 23 |

Journal | Acta Informatica |

Volume | 51 |

Issue number | 7 |

DOIs | |

State | Published - 31 Oct 2014 |

Externally published | Yes |

## ASJC Scopus subject areas

- Software
- Information Systems
- Computer Networks and Communications