Q3976790
type: Item
instance of: scholarly article
zbMATH Open document ID: 0737.90034
publication date: 1992-06-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 19351
zbMATH Keywords: scheduled flow graph
zbMATH Keywords: \(NP\)-complete
zbMATH Keywords: polynomial time
zbMATH Keywords: set-covering
zbMATH Keywords: approximative algorithm
author: Klaus Jansen
MaRDI profile type: Publication
Recommended article: Processor optimization for flow graphs
Recommended article: The processor identity problem
Recommended article: An optimal problem in parallel computing
Recommended article: Q3140395
Recommended article: Fast Deterministic Processor Allocation
Recommended article: Q4028027
Recommended article: Q4708576
description: scientific article; zbMATH DE number 19351