scientific article
From MaRDI portal
Publication:2861543
zbMath1274.05152MaRDI QIDQ2861543
Yerim Chung, Marc Demange, Jean-François Culus
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001447
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Some Inverse Traveling Salesman Problems ⋮ Notes on inverse bin-packing problems ⋮ On the complexity of the selective graph coloring problem in some special classes of graphs
Cites Work
- Computational complexity of some restricted instances of 3-SAT
- Non-approximability of just-in-time scheduling
- The maximum k-colorable subgraph problem for chordal graphs
- On chain and antichain families of a partially ordered set
- On an instance of the inverse shortest paths problem
- Some partitions associated with a partially ordered set
- Scheduling equal-length jobs on identical parallel machines
- Track assignment
- Online Bounded Coloring of Permutation and Overlap Graphs
- On Minimum k-Modal Partitions of Permutations
- Inverse Optimization
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- The Complexity of Coloring Circular Arcs and Chords
- Minimizing maximum lateness on one machine: computational experience and some applications
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
- The structure of Sperner k-families
This page was built for publication:
