Algorithms and Computation
From MaRDI portal
Publication:5897914
DOI10.1007/11602613zbMath1175.05052OpenAlexW2304246803MaRDI QIDQ5897914
Samuel Fiorini, Jean Cardinal, Gwenaël Joret
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Tight results on minimum entropy set cover ⋮ Clique partitioning of interval graphs with submodular costs on the cliques ⋮ Minimum sum edge colorings of multicycles ⋮ “Rent-or-Buy” Scheduling and Cost Coloring Problems ⋮ Minimum entropy orientations ⋮ Interval scheduling with economies of scale
This page was built for publication: Algorithms and Computation
