Reducing Matching to Polynomial Size Linear Programming (Q4277507): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:02, 6 February 2024
scientific article; zbMATH DE number 495747
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing Matching to Polynomial Size Linear Programming |
scientific article; zbMATH DE number 495747 |
Statements
Reducing Matching to Polynomial Size Linear Programming (English)
0 references
7 February 1994
0 references
compact linear program
0 references
systems of linear inequalities
0 references
polynomial algorithm
0 references
matching
0 references
Chinese postman
0 references
minimum mean cycle problems
0 references
