scientific article; zbMATH DE number 6469191
From MaRDI portal
Publication:5501309
Recommendations
- Automata, Languages and Programming
- Approximating the max-edge-coloring problem
- Approximation Algorithms for Maximum Edge Coloring Problem
- Approximation algorithm for maximum edge coloring
- Using the minimum maximum flow degree to approximate the flow coloring problem
- Maximizing the number of unused colors in the vertex coloring problem
- Approximating the max edge-coloring problem
- Approximation and Online Algorithms
- On the minimum load coloring problem
- Maximizing proper colorings on graphs
Cited in
(37)- Minimum entropy coloring
- Variable sized online interval coloring with bandwidth
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Weighted coloring: further complexity and approximability results
- An easy subexponential bound for online chain partitioning
- On-line dimension for posets excluding two long incomparable chains
- A note on the Cornaz-Jost transformation to solve the graph coloring problem
- Bounded max-colorings of graphs
- A one-to-one correspondence between colorings and stable sets
- Iterated local search with tabu search for the weighted vertex coloring problem
- Forbidden structures for efficient first-fit chain partitioning (extended abstract)
- A refined analysis of online path coloring in trees
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
- Approximating interval coloring and max-coloring in chordal graphs
- Minimum entropy combinatorial optimization problems
- On the Maximum Edge Coloring Problem
- First-fit chromatic numbers of \(d\)-degenerate graphs
- First-fit coloring on interval graphs has performance ratio at least 5
- A Dichotomy Theorem for First-Fit Chain Partitions
- First-fit coloring of bounded tolerance graphs
- On the Max Coloring Problem
- Automata, Languages and Programming
- Complexity and online algorithms for minimum skyline coloring of intervals
- Max-coloring of vertex-weighted graphs
- Buffer minimization with conflicts on a line
- On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio
- On the max-weight edge coloring problem
- First-Fit is linear on posets excluding two long incomparable chains
- On the max coloring problem
- Minimum entropy combinatorial optimization problems
- Towards more efficient local search for weighted graph coloring problem in massive graphs
- On the on-line coloring of unit interval graphs with proper interval representation
- Clique clustering yields a PTAS for max-coloring interval graphs
- A note on first-fit coloring of interval graphs
- Online unit clustering: Variations on a theme
- Online interval coloring with packing constraints
- Approximating the max-edge-coloring problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501309)
