“Rent-or-Buy” Scheduling and Cost Coloring Problems
From MaRDI portal
Publication:5458824
DOI10.1007/978-3-540-77050-3_7zbMath1135.90344OpenAlexW1566807690MaRDI QIDQ5458824
Hiroshi Nagamochi, Takuro Fukunaga, Magnús M. Halldórsson
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_7
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Graph multi-coloring for a job scheduling application ⋮ Fixed interval scheduling with third‐party machines ⋮ Minimum Entropy Combinatorial Optimization Problems ⋮ Minimum entropy combinatorial optimization problems ⋮ Interval scheduling with economies of scale
Cites Work
- Restrictions of graph partition problems. I
- Weighted coloring: further complexity and approximability results
- Scheduling jobs with fixed start and end times
- The maximum k-colorable subgraph problem for chordal graphs
- On chain and antichain families of a partially ordered set
- A still better performance guarantee for approximate graph coloring
- Zero knowledge and the chromatic number
- Network flow, transportation and scheduling. Theory and algorithms
- Approximating minimum cocolorings.
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- On the probabilistic minimum coloring and minimum \(k\)-coloring
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Clique partitioning of interval graphs with submodular costs on the cliques
- Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
- Maximum weightk-independent set problem on permutation graphs
- Approximating Maximum Clique by Removing Subgraphs
- Approximation Results for the Optimum Cost Chromatic Partition Problem
- Algorithms and Computation
This page was built for publication: “Rent-or-Buy” Scheduling and Cost Coloring Problems
