Fixed-phase retiming for low power design
ISLPED '96 Proceedings of the 1996 international symposium on Low power electronics and design
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
An Analysis of Zero-Clairvoyant Scheduling
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Parametric Scheduling for Network Constraints
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Specification Framework for Real-Time Scheduling
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Minimizing a Convex Cost Closure Set
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
A Dual Interpretation of "Standard Constraints" in Parametric Scheduling
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Cycles in Generalized Networks
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On policy iteration as a Newton's method and polynomial policy iteration algorithms
Eighteenth national conference on Artificial intelligence
Periodic Linear Programming with applications to real-time scheduling
Mathematical Structures 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
Cyclic games and linear programming
Discrete Applied Mathematics
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Introduction to the Maximum Solution Problem
Complexity of Constraints
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
ACM Transactions on Algorithms (TALG)
Two variables per linear inequality as an abstract domain
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
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
Computers and Operations Research
A set partitioning reformulation of a school bus scheduling problem
Journal of Scheduling
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
Approximability of integer programming with generalised constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Optimization over integers with robustness in cost and few constraints
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Finding a bounded mixed-integer solution to a system of dual network inequalities
Operations Research Letters
An efficient algorithm for a class of constraint satisfaction problems
Operations Research Letters
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
Computational complexity of linear constraints over the integers
Artificial Intelligence
Automatic design rule correction in presence of multiple grids and track patterns
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
The authors present an $O(mn^2 \log m)$ algorithm for solving feasibility in linear programs with up to two variables per inequality which is derived directly from the Fourier--Motzkin elimination method. (The number of variables and inequalities are denoted by $n$ and $m$, respectively.) The running time of the algorithm dominates that of the best known algorithm for the problem, and is far simpler. Integer programming on monotone inequalities, i.e., inequalities where the coefficients are of opposite sign, is then considered. This problem includes as a special case the simultaneous approximation of a rational vector with specified accuracy, which is known to be NP-complete. However, it is shown that both a feasible solution and an optimal solution with respect to an arbitrary objective function can be computed in pseudo-polynomial time.