\(k\)-partitioning problems with partition matroid constraint

DOI10.1016/j.tcs.2006.11.016zbMath1164.68042OpenAlexW1997800113MaRDI QIDQ1022585

Biao Wu, Enyue Yao

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.016

zbMATH Keywords

partitioninganalysis of algorithmworst case ratioconstrained partition

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Related Items (3)

Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint ⋮ Optimal matroid partitioning problems ⋮ Unnamed Item

Cites Work

• 3-partitioning problems for maximizing the minimum load
• The exact LPT-bound for maximizing the minimum completion time
• The \(k\)-partitioning problem
• A tight bound for 3-partitioning
• \(\kappa\)-partitioning problems for maximizing the minimum load
• On uniform \(k\)-partition problems
• Optimal Set Partitioning
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Bounds on Multiprocessing Timing Anomalies
• Bounds for the cardinality constrained \(P \|C_{max}\) problem
• Unnamed Item

This page was built for publication: \(k\)-partitioning problems with partition matroid constraint