scientific article; zbMATH DE number 1161371

MaRDI QIDQ4393369zbMATH OpenFDO

Authors Robert R. Goldberg, Jacob Shapiro, Jerry Waxman

Publication date 1 October 1998

zbMATH Keywords

load balancingworst case analysis

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1046599
• scientific article; zbMATH DE number 1185313
• The \(k\)-partitioning problem

Cited in

(19)

• A fixed parameter algorithm for optimal convex partitions
• An algorithm to maximize the agreement between partitions
• A tight upper bound for the \(k\)-partition problem on ideal sets
• The maximum saving partition problem
• Least-cost partition algorithms
• Approximation algorithms for the partial assignment problem
• Efficient algorithm for optimizing spectral partitions
• Optimal Set Partitioning
• scientific article; zbMATH DE number 3843505 (Why is no real title available?)
• scientific article; zbMATH DE number 3908442 (Why is no real title available?)
• Worst-case analysis of the differencing method for the partition problem
• scientific article; zbMATH DE number 1185313 (Why is no real title available?)
• scientific article; zbMATH DE number 1046599 (Why is no real title available?)
• Approximation algorithms for array partitioning problems
• scientific article; zbMATH DE number 800169 (Why is no real title available?)
• Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Fundamentals of Computation Theory
• Approximation results for the weighted \(P_4\) partition problem

This page was built for publication:

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