A note on the hardness of Skolem-type sequences
type: Item
instance of: scholarly article
title: A note on the hardness of Skolem-type sequences
zbMATH Open document ID: 1232.05046
author: Gustav Nordh
published in: Discrete Applied Mathematics
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 11B83
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5711863
zbMATH Keywords: Skolem sequence
zbMATH Keywords: \(\mathbf{NP}\)-completeness
zbMATH Keywords: coupled task scheduling
MaRDI profile type: Publication
full work available at URL: j.dam.2010.01.006
OpenAlex ID: W2035130077
cites work: Extended skolem sequences
cites work: Q4312265
cites work: The complexity of completing partial Latin squares
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
cites work: Extended Langford sequences with small defects
cites work: The existence of \((p,q)\)-extended Rosa sequences
cites work: Perfect Skolem sets
cites work: \(\mathcal{NP}\)-completeness of generalized multi-Skolem sequences
cites work: On certain distributions of integers in pairs with given differences
cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
DOI: 10.1016/J.DAM.2010.01.006
description: scientific article; zbMATH DE number 5711863