A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/mp/AroraFK02, #quickstatements; #temporary_batch_1738163672219 |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070100271 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s101070100271 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965193466 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070100271 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mp/AroraFK02 / rank | |||
Normal rank | |||
Latest revision as of 17:15, 29 January 2025
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
