A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57401523, #quickstatements; #temporary_batch_1707216511891 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401523 / rank | |||
Normal rank | |||
Revision as of 12:42, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new rounding procedure for the assignment problem with applications to dense graph arrangement problems |
scientific article |
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
