Minimum Entropy Combinatorial Optimization Problems
From MaRDI portal
Publication:3576040
DOI10.1007/978-3-642-03073-4_9zbMath1268.90059OpenAlexW1944808633MaRDI QIDQ3576040
Jean Cardinal, Gwenaël Joret, Samuel Fiorini
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_9
Related Items (2)
Minimum entropy combinatorial optimization problems ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Entropy splitting for antiblocking corners and perfect graphs
- Tight results on minimum entropy set cover
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
- Minimum entropy coloring
- The maximum k-colorable subgraph problem for chordal graphs
- On the sum coloring problem on interval graphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Approximating min sum set cover
- Minimum entropy orientations
- The minimum-entropy set cover problem
- Greed is good
- Clique partitioning of interval graphs with submodular costs on the cliques
- A threshold of ln n for approximating set cover
- Locality in Distributed Graph Algorithms
- On zero-error source coding with decoder side information
- Zero-error information theory
- Source coding and graph entropies
- An efficient algorithm for partial order production
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
This page was built for publication: Minimum Entropy Combinatorial Optimization Problems
