The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters
Locality in distributed graph algorithms
SIAM Journal on Computing
Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Min Sum Set Cover
Algorithmica
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Distributed Functional Compression through Graph Coloring
DCC '07 Proceedings of the 2007 Data Compression Conference
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of a new algorithm for partial haplotype completion
International Journal of Bioinformatics Research and Applications
Tight Results on Minimum Entropy Set Cover
Algorithmica
Highly Scalable Genotype Phasing by Entropy Minimization
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing
"Rent-or-buy" scheduling and cost coloring problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Source coding and graph entropies
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On zero-error source coding with decoder side information
IEEE Transactions on Information Theory
Operations Research Letters
| Hi-index | 0.00 |
We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.