Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality |
scientific article; zbMATH DE number 558708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality |
scientific article; zbMATH DE number 558708 |
Statements
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (English)
0 references
1993
0 references
integer linear minimization
0 references
vertex cover problem
0 references
2-satisfiability problem
0 references
0.92595506
0 references
0.92077667
0 references
0.91675484
0 references
0.89974236
0 references
0.89913785
0 references
0 references
0.8850013
0 references
