A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Cycles in Generalized Networks
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A simple GAP-canceling algorithm for the generalized maximum flow problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient non-myopic value-of-information computation for influence diagrams
International Journal of Approximate Reasoning
Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Embedding rivers in polyhedral terrains
Proceedings of the twenty-fifth annual symposium on Computational geometry
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
ACM Transactions on Algorithms (TALG)
Constraints solution for time sensitive security protocols
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Listing vertices of simple polyhedra associated with dual LI (2) systems
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A set partitioning reformulation of a school bus scheduling problem
Journal of Scheduling
Mechanism design: from partial to probabilistic verification
Proceedings of the 13th ACM Conference on Electronic Commerce
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
The authors show that a system of $m$ linear inequalities with $n$ variables, where each inequality involves at most two variables, can be solved in $\tilde{O}(mn^2)$ time (we denote $\tilde{O}(f)=O(f\polylog n\polylog m))$ deterministically, and in $\tilde{O}(n^3+mn)$ expected time using randomization. Parallel implementations of these algorithms run in $\tilde{O}(n)$ time, where the deterministic algorithm uses $\tilde{O}(mn)$ processors and the randomized algorithm uses $\tilde{O}(n^2+m)$ processors. The bounds significantly improve over previous algorithms. The randomized algorithm is based on novel insights into the structure of the problem.