An asymptotically exact polynomial algorithm for equipartition problems

DOI10.1016/0166-218X(86)90032-6zbMath0593.90053OpenAlexW2027669460MaRDI QIDQ1076607

Bruno Simeone

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90032-6

zbMATH Keywords

clusteringapproximate algorithmasymptotically exact polynomial algorithmequipartition problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items

A survey for the quadratic assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• Fast Approximation Algorithms for Knapsack Problems
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• P-Complete Approximation Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• `` Strong NP-Completeness Results
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Reducibility among Combinatorial Problems
• Scheduling to Minimize Interaction Cost