A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093)
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: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems |
scientific article; zbMATH DE number 1754739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new rounding procedure for the assignment problem with applications to dense graph arrangement problems |
scientific article; zbMATH DE number 1754739 |
Statements
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (English)
0 references
12 June 2002
0 references
randomized procedure for rounding fractional perfect matchings to integral matchings
0 references
additive approximation algorithm
0 references
Polynomial Time Approximation Schemes
0 references
