Approximating minimum sum coloring with bundles

DOI10.4230/LIPICS.SWAT.2024.21MaRDI QIDQ6891130zbMATH OpenFDO

Authors Seyed Parsa Darbouy, Zachary Friggstad

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2024.21

zbMATH Keywords

approximation algorithmscoloringscheduling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A condition for matchability in hypergraphs
• AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
• Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs
• Approximation and Online Algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Integrality gap of time-indexed linear programming relaxation for coflow scheduling
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Matroid coflow scheduling
• On chromatic sums and distributed resource allocation
• On scheduling coflows (extended abstract)
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• Unit disk graphs

Cited in

(1)

• Minimum sum coloring with bundles in trees and bipartite graphs

This page was built for publication: Approximating minimum sum coloring with bundles

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