Sum edge coloring of multigraphs via configuration LP

DOI10.1145/1921659.1921668zbMath1295.90010OpenAlexW2075580456MaRDI QIDQ3189004

Magnús M. Halldórsson, M. I. Sviridenko, Guy Kortsarz

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1921659.1921668

zbMATH Keywords

approximation algorithmsconfiguration LPedge scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

On the performance guarantee of first fit for sum coloring ⋮ Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs ⋮ Scheduling Problems over Network of Machines ⋮ Scheduling problems over a network of machines

This page was built for publication: Sum edge coloring of multigraphs via configuration LP