"A new rounding procedure for the assignment problem with applications to ..."

Sanjeev Arora, Alan M. Frieze, Haim Kaplan (2002)

> Home

Details and statistics

DOI: 10.1007/S101070100271

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/AroraFK02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/AroraFK02
Sanjeev Arora, Alan M. Frieze, Haim Kaplan:
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. 92(1): 1-36 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.