Enumerating Near-Min s-t Cuts

Authors
Balcioglu, Ahmet
Wood, R. Kevin
Subjects
graphs, networks, cuts, enumeration, polynomial-time algorithm
Advisors
Date of Issue
2003
Date
Publisher
Language
Abstract
We develop a factoring (partitioning) algorithm for enumerating near-minimum-weight...
Type
Book Chapter
Description
in Network Interdiction and Stochastic Integer Programming, ed. Woodruff, D.L. and Kluwer Academic Publishers, pp. 21-49.
URI
https://hdl.handle.net/10945/38418
Series/Report No
Department
Operations Research (OR)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications
Load more