Linear programming without the matrix
From MaRDI portal
Publication:5248478
DOI10.1145/167088.167127zbMath1310.90073MaRDI QIDQ5248478
Christos H. Papadimitriou, Mihalis Yannakakis
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167127
68Q25: Analysis of algorithms and problem complexity
91B06: Decision theory
90C05: Linear programming
Related Items
Algorithmic mechanism design, Efficient distributed approximation algorithms via probabilistic tree embeddings, The \(k\)-server problem, Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding, Analysing local algorithms in location-aware quasi-unit-disk graphs, Local approximability of max-min and min-max linear programs, A simple local 3-approximation algorithm for vertex cover, Two sensitivity theorems in fuzzy integer programming., Delayed information and action in on-line algorithms, Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost, On the distributed decision-making complexity of the minimum vertex cover problem, A distributed voting scheme to maximize preferences, Solving Linear Programming with Constraints Unknown
