Activity selection games and the minimum-cut problem
Author:
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Super-modularity: Applications to convex games and to the greedy algorithm for LPJournal of Economic Theory, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Maximal Closure of a Graph and Applications to Combinatorial ProblemsManagement Science, 1976
- Minimum cuts and related problemsNetworks, 1975
- A greedy algorithm for solving a certain class of linear programmesMathematical Programming, 1973
- A Graph-Theoretic Equivalence for Integer ProgramsOperations Research, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Notes—On a Selection ProblemManagement Science, 1970
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965