General approximation algorithms for some arithmetical combinatorial problems
type: Item
instance of: scholarly article
title: General approximation algorithms for some arithmetical combinatorial problems
zbMATH Open document ID: 0474.68080
DOI: 10.1016/0304-3975(81)90047-5
author: Shlomo Moran
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3744567
zbMATH Keywords: subset sum problem
zbMATH Keywords: job sequencing with deadlines
zbMATH Keywords: subset product problem
zbMATH Keywords: NP-complete
zbMATH Keywords: optimization problems
zbMATH Keywords: full approximability
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90047-5
OpenAlex ID: W1980563498
cites work: On the computational power of pushdown automata
cites work: Q4161330
cites work: `` Strong '' NP-Completeness Results
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4142699
cites work: Q4124328
cites work: Q4125769
cites work: Algorithms for Scheduling Independent Tasks
description: scientific article; zbMATH DE number 3744567