Exploiting a Hypergraph Model for Finding Golomb Rulers
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.
KeywordsHitting Set NP-Hardness Parameterized Complexity Data Reduction Problem Kernel Forbidden Subgraph Characterization
Unable to display preview. Download preview PDF.
- 2.Babcock, W.: Intermodulation interference in radio systems. Bell Syst. Tech. J., 63–73 (1953)Google Scholar
- 6.Dimitromanolakis, A.: Analysis of the Golomb ruler and the Sidon set problems, and determination of large, near-optimal Golomb rulers. Master’s thesis, Department of Electronic and Computer Engineering, Technical University of Crete (June 2002)Google Scholar
- 7.Distributed.net. Home page, http://www.distributed.net/ (accessed April 2012)
- 10.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)Google Scholar
- 12.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 15.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)Google Scholar
- 16.Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. Dagstuhl Seminar Proceedings, vol. 5, pp. 17–32. IBFI Dagstuhl, Germany (2010)Google Scholar
- 18.Rankin, W.T.: Optimal Golomb rulers: An exhaustive parallel search implementation. Master’s thesis, Department of Electrical Engineering, Duke University, Durham, Addendum by Aviral Singh (1993)Google Scholar
- 19.Sorge, M.: Algorithmic aspects of Golomb ruler construction. Studienarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany, Available electronically, arXiv:1005.5395v2 (2010)Google Scholar