On the nearest product of partitions

MaRDI QIDQ808258zbMATHFDO

Authors Krzysztof Musiał, Ngoc Thanh Nguyen

Publication date 1989

Published in Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

nearest partition product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• Computational complexity of the product partition problem
• On the complexity of some partition problems
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
• ``NP\(=\)P? and restricted partitions

Cited in

(4)

• Computational complexity of the product partition problem
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• scientific article; zbMATH DE number 6007641 (Why is no real title available?)
• Consensus system for solving conflicts in distributed systems

This page was built for publication: On the nearest product of partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808258)