Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68114OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716853

Rajiv Raman, Sriram V. Pemmaraju

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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 (24)

Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results ⋮ On Monte Carlo tree search for weighted vertex coloring ⋮ Iterated local search with tabu search for the weighted vertex coloring problem ⋮ On the max-weight edge coloring problem ⋮ Capacitated max-batching with interval graph compatibilities ⋮ Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring ⋮ Batch Coloring Flat Graphs and Thin ⋮ Improved approximation algorithms for the max edge-coloring problem ⋮ Max-coloring paths: tight bounds and extensions ⋮ Bounded max-colorings of graphs ⋮ On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains ⋮ Clique Clustering Yields a PTAS for max-Coloring Interval Graphs ⋮ Saving colors and max coloring: some fixed-parameter tractability results ⋮ On the max coloring problem ⋮ Approximating the max-edge-coloring problem ⋮ On the Maximum Edge Coloring Problem ⋮ On the Max Coloring Problem ⋮ Clique clustering yields a PTAS for max-coloring interval graphs ⋮ Max-coloring of vertex-weighted graphs ⋮ Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs ⋮ Weighted coloring on planar, bipartite and split graphs: Complexity and approximation ⋮ On-line chain partitions of orders: a survey ⋮ Weighted coloring: further complexity and approximability results ⋮ Clique partitioning with value-monotone submodular cost

This page was built for publication: Automata, Languages and Programming