3-partitioning problems for maximizing the minimum load

DOI10.1023/A:1013370208101MaRDI QIDQ702354zbMATH OpenOpenAlexFDO

Authors Shiping Chen, Yong He, Guohui Lin

Publication date 17 January 2005

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013370208101

zbMATH Keywords

kernelschedulingworst case performance ratioanalysis of algorithmPartitioning

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• \(\kappa\)-partitioning problems for maximizing the minimum load
• An improved approximation algorithm for the minimum 3-path partition problem
• The three-dimensional assignment and partition problems. New lower bounds
• Max-Min 3-Dispersion problems
• The partitioning min-max weighted matching problem
• A tight bound for 3-partitioning
• Optimal partitions for triples
• Min-Max partitioning problem with matroid constraint
• A greedy heuristic for 3-partitioning with similar elements
• A local search 4/3-approximation algorithm for the minimum 3-path partition problem

Cited in

(9)

• A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling
• Optimal matroid partitioning problems
• Optimal matroid partitioning problems
• \(\kappa\)-partitioning problems for maximizing the minimum load
• A tight bound for 3-partitioning
• \(k\)-partitioning problems with partition matroid constraint
• Approximation algorithms for k-partitioning problems with partition matroid constraint
• Three-partitioning containing kernels: Complexity and heuristic
• Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint

This page was built for publication: 3-partitioning problems for maximizing the minimum load

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