Efficient algorithms for integer programs with two variables per constraint. (Q5943665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1652501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for integer programs with two variables per constraint. |
scientific article; zbMATH DE number 1652501 |
Statements
Efficient algorithms for integer programs with two variables per constraint. (English)
0 references
27 September 2001
0 references
Combinatorial optimization: Integer programming
0 references
Approximation algorithm
0 references
Local-ratio technique
0 references
2 SAT
0 references
Vertex cover
0 references
0.9952206015586852
0 references
0.8739669919013977
0 references
0.8687044978141785
0 references
0.8472780585289001
0 references
