Approximation algorithms for multicommodity flow and normalized cut problems: Implementations and experimental study

Conference proceeding

Peer reviewed

YING DU, Danny Z Chen and XIAODONG WU

Lecture notes in computer science, Vol.3106, pp.112-121

COCOON 2004 : computing and combinatorics (Jeju Island, 17-20 August 2004)

2004

DOI: 10.1007/978-3-540-27798-9_14

View Online

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Theoretical computing

Title: Subtitle: Approximation algorithms for multicommodity flow and normalized cut problems: Implementations and experimental study
Creators: YING DU - University of Notre Dame
Danny Z Chen - University of Notre Dame
XIAODONG WU - University of Texas–Pan American
Resource Type: Conference proceeding
Publication Details: Lecture notes in computer science, Vol.3106, pp.112-121
Conference: COCOON 2004 : computing and combinatorics (Jeju Island, 17-20 August 2004)
Publisher: Springer
DOI: 10.1007/978-3-540-27798-9_14
ISSN: 0302-9743
eISSN: 1611-3349
Language: English
Date published: 2004
Academic Unit: The Iowa Institute for Biomedical Imaging; Electrical and Computer Engineering; Radiation Oncology
Record Identifier: 9984197071002771

6 Record Views