Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems

Conference proceeding

Peer reviewed

E Boros, K Elbassioni, V Gurvich and L Khachiyan

Lecture notes in computer science, Vol.3064, pp.152-162

IPCO : integer programming and combinatorial optimization (New York NY, 7-11 June 2004)

2004

Abstract

Applied sciences

Exact sciences and technology

Mathematical programming

Operational research and scientific management

Operational research. Management science

6 Record Views

Title: Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems
Creators: E Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
K Elbassioni - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
V Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
L Khachiyan - Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, Piscataway NJ 08854-8003, United States
Publication Details: Lecture notes in computer science, Vol.3064, pp.152-162
Conference: IPCO : integer programming and combinatorial optimization (New York NY, 7-11 June 2004)
Date published: 2004
Publisher: Springer
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031665522704646