A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
type: Item
instance of: scholarly article
title: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
zbMATH Open document ID: 1154.90602
author: Haim Kaplan
author: Alan Frieze
author: Sanjeev Arora
published in: Mathematical Programming. Series A. Series B
publication date: 2002-06-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1754739
zbMATH Keywords: randomized procedure for rounding fractional perfect matchings to integral matchings
zbMATH Keywords: additive approximation algorithm
zbMATH Keywords: Polynomial Time Approximation Schemes
Wikidata QID: Q57401523
MaRDI profile type: Publication
full work available at URL: s101070100271
OpenAlex ID: W1965193466
DOI: 10.1007/S101070100271
DBLP publication ID: journals/mp/AroraFK02
description: scientific article; zbMATH DE number 1754739