Reducing Matching to Polynomial Size Linear Programming (Q4277507): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0803035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978037005 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:43, 20 March 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
