scientific article; zbMATH DE number 6823767
From MaRDI portal
Publication:4602398
Recommendations
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\)
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- \(\mathcal{NP}\)-hardness of approximately solving linear equations over reals
- NP-hardness of approximately solving linear equations over reals
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Cited in
(6)- Hardness of MAX-2Lin and MAX-3Lin over integers, reals, and large cyclic groups
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
- Gadgets, Approximation, and Linear Programming
- UG-hardness to NP-hardness by losing half
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Improved NP-inapproximability for 2-variable linear equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602398)