Minimum entropy orientations
TL;DR: It is proved 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.
read more
About: This article is published in Operations Research Letters. The article was published on 01 Nov 2008. and is currently open access. The article focuses on the topics: Maximum entropy probability distribution & Min entropy.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Minimum Entropy Combinatorial Optimization Problems
TL;DR: This work surveys recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution, including the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.
12
Minimum Entropy Combinatorial Optimization Problems
Jean Cardinal,Samuel Fiorini,Gwenaël Joret +2 more
- 15 Jul 2009
TL;DR: This work surveys recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution, including the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.
10
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
Gabriel Istrate,Cosmin Bonchis +1 more
- 05 Jul 2016
TL;DR: This work outlines results and open problems concerning partitioning of integer sequences and partial orders into heapable subsequences (previously defined and established by Byers et al.).
•Posted Content
Set Covering Problems with General Objective Functions
TL;DR: A parameterized version of set cover that generalizes several previously studied problems and derives an approximation ratio for a Rent-or-Buy set cover problem.
5
•Posted Content
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games
Cosmin Bonchis,Gabriel Istrate +1 more
TL;DR: A parametric family of measures of fairness in allocations of TU-cooperative games is proposed, based on generalized Renyi Entropy, which is related to the Cowell-Kuga generalized entropy indices in welfare economics, and aims to parallel the spirit of the notion of price of anarchy in the case of convex T U- cooperative games.
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
•Book
Combinatorial Optimization
William J. Cook,William H. Cunningham,William R. Pulleyblank,Alexander Schrijver +3 more
- 12 Nov 1997
2.9K
Inequalities (Cambridge Mathematical Library)
G. H. Hardy,J. E. Littlewood,George Pólya +2 more
- 01 Jan 1934
304
Approximating Min Sum Set Cover
Uriel Feige,Prasad Tetali +1 more
TL;DR: For the min sum vertex cover version of the problem, it is shown that it can be approximated within a ratio of 2, and is NP-hard to approximate within some constant ρ > 1.
205
Related Papers (5)
Eran Halperin,Richard M. Karp +1 more
- 08 Dec 2005
Amit Chakrabarti,Khanh Do Ba,S. Muthukrishnan +2 more
- 23 Feb 2006
Philip M. Long,Xinyu Wu +1 more
- 01 Dec 2004