Work

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1996.548460

Authors: S. Arora, A. Frieze, H. Kaplan

Institutions: Princeton University, Carnegie Mellon University, Tel Aviv University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2141072246

FWCI: 4.18

Cites: 24

Cited by: 80

Related to: 10