Exploiting a Hypergraph Model for Finding Golomb Rulers
type: Item
instance of: scholarly article
title: Exploiting a Hypergraph Model for Finding Golomb Rulers
zbMATH Open document ID: 1360.68519
DOI: 10.1007/978-3-642-32147-4_33
author: Manuel Sorge
author: Hannes Moser
author: Rolf Niedermeier
author: Mathias Weller
published in: Lecture Notes in Computer Science
publication date: 2012-11-02T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6101798
zbMATH Keywords: hitting set
zbMATH Keywords: NP-hardness
zbMATH Keywords: parameterized complexity
zbMATH Keywords: data reduction
zbMATH Keywords: problem kernel
zbMATH Keywords: forbidden subgraph characterization
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-32147-4 33
OpenAlex ID: W1862050608
Recommended article: Exploiting a hypergraph model for finding Golomb rulers
Recommended article: On the complexity of constructing Golomb rulers
Recommended article: Local search-based hybrid algorithms for finding Golomb rulers
Recommended article: Constraint-Based Local Search for Golomb Rulers
Recommended article: An Algorithmic Version of the Hypergraph Regularity Method
Recommended article: A conjecture on a continuous optimization model for the Golomb Ruler Problem
Recommended article: Finding models through graph saturation
Recommended article: A computational comparison of optimization methods for the Golomb ruler problem
Recommended article: The hypergraph regularity method and its applications
Recommended article: Q4393352
description: scientific article; zbMATH DE number 6101798