On the complexity of optimal multisplitting

DOI10.1007/3-540-39963-1_58MaRDI QIDQ2766993zbMATH OpenFDO

Authors Tapio Elomaa, Juho Rousu

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39963-1_58

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the computational complexity of optimal multisplitting
• On the Complexity of Distributed Splitting Problems
• Greedy splitting algorithms for approximating multiway partition problems
• On generalized greedy splitting algorithms for multiway partition problems
• Algorithmic approach to the split problems
• scientific article; zbMATH DE number 954657
• scientific article; zbMATH DE number 4218375
• Computational complexity of weighted splitting schemes on parallel computers
• Computing and Combinatorics

Cited in

(9)

• Efficient splitting and merging algorithms for order decomposable problems.
• On generalized greedy splitting algorithms for multiway partition problems
• General and efficient multisplitting of numerical attributes
• On the computational complexity of optimal multisplitting
• scientific article; zbMATH DE number 4218375 (Why is no real title available?)
• scientific article; zbMATH DE number 1107648 (Why is no real title available?)
• scientific article; zbMATH DE number 954657 (Why is no real title available?)
• Parameterized and Exact Computation
• A note on optimal multiway split trees

This page was built for publication: On the complexity of optimal multisplitting

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