Two-phase greedy algorithms for some classes of combinatorial linear programs
Abstract
References
Index Terms
- Two-phase greedy algorithms for some classes of combinatorial linear programs
Recommendations
Two-phase greedy algorithms for some classes of combinatorial linear programs
SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithmsWe present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our algorithms compute in a first phase Monge solutions for the associated dual ...
Dual greedy polyhedra, choice functions, and abstract convex geometries
We consider a system of linear inequalities and its associated polyhedron for which we can maximize any linear objective function by finding tight inequalities at an optimal solution in a greedy way. We call such a system of inequalities a dual greedy ...
A greedy algorithm for convex geometries
SubmodularityConvex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions defined on the sets of the extreme points of a convex geometry. Faigle-Kern (Math. Programming 72 (1996) 195-206)...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 330Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in