Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662): Difference between revisions

@@ Property / author @@
-Joseph (Seffi) Naor
@@ Property / author: Joseph (Seffi) Naor / rank @@
-Normal rank
@@ Property / author @@
+Joseph (Seffi) Naor
@@ Property / author: Joseph (Seffi) Naor / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Testing the necklace condition for shortest tours and optimal factors in the plane
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+A bounded approximation for the minimum cost 2-sat problem
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the Two-Variable Integer Programming Problem
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Simultaneous Diophantine Approximation Problems
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Towards a Genuinely Polynomial Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Maximal Closure of a Graph and Applications to Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank