Lower and upper bounds for the allocation problem and other nonlinear optimization problems
Mathematics of Operations Research
On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
Mathematics of Operations Research
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)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tight Results on Minimum Entropy Set Cover
Algorithmica
Variations of the maximum leaf spanning tree problem for bipartite graphs
Information Processing Letters
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
Information Processing Letters
| Hi-index | 0.00 |
We study graph orientations that minimize the entropy of the in-degree sequence. We prove that the minimum entropy orientation problem is NP-hard even if the graph is planar, and that there exists a simple linear-time algorithm that returns an approximate solution with an additive error guarantee of 1 bit.