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

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1996, Pages 21-30

  Arora, Sanjeev ^a   Frieze, Alan ^a   Kaplan, Haim ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES;

DENSE GRAPH ASSIGNMENT PROBLEMS; FRACTIONAL PERFECT MATCHINGS; QUADRATIC ASSIGNMENT PROBLEM;

PROBLEM SOLVING;

EID: 0030409562     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)