Min Sum Edge Coloring in Multigraphs Via Configuration LP
From MaRDI portal
Publication:3503859
DOI10.1007/978-3-540-68891-4_25zbMath1143.90334MaRDI QIDQ3503859
M. I. Sviridenko, Magnús M. Halldórsson, Guy Kortsarz
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_25
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- On chromatic sums and distributed resource allocation
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- The Santa Claus problem
- Tight approximation algorithms for maximum general assignment problems
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Scheduling File Transfers
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
- Polynomial algorithms in linear programming
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Data migration to minimize the total completion time
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Automata, Languages and Programming
