A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter and creates a second, inner relaxation that...

Full description

Saved in:
Bibliographic Details
Published in:SIAM Journal on Discrete Mathematics Vol. 19; no. 2; pp. 304 - 320
Main Authors: Iwata, Satoru, McCormick, S. Thomas, Shigeno, Maiko
Format: Journal Article
Language:English
Japanese
Published: Philadelphia Society for Industrial & Applied Mathematics (SIAM) 01.01.2005
Society for Industrial and Applied Mathematics
Subjects:
Algorithms
Applied mathematics
Costs
Integer programming
Linear algebra
Mathematical programming
Optimization
ISSN:0895-4801, 1095-7146
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter and creates a second, inner relaxation that is a kind of submodular max flow problem. The outer relaxation uses a novel technique for relaxing the submodular constraints that allows our previous proof techniques to work. The algorithm uses the min cuts from the max flow subproblem as the relaxed most positive cuts it chooses to cancel. We show that this algorithm needs to cancel only ${\mathrm O}(n^3)$ cuts per scaling phase, where $n$ is the number of nodes. Furthermore, we show how to slightly modify this algorithm to get a strongly polynomial running time. Finally, we briefly show how to extend this algorithm to the separable convex cost case and that the same technique can be used to construct a polynomial time maximum mean cut canceling algorithm for submodular flow.
AbstractList This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter and creates a second, inner relaxation that is a kind of submodular max flow problem. The outer relaxation uses a novel technique for relaxing the submodular constraints that allows our previous proof techniques to work. The algorithm uses the min cuts from the max flow subproblem as the relaxed most positive cuts it chooses to cancel. We show that this algorithm needs to cancel only ${\mathrm O}(n^3)$ cuts per scaling phase, where $n$ is the number of nodes. Furthermore, we show how to slightly modify this algorithm to get a strongly polynomial running time. Finally, we briefly show how to extend this algorithm to the separable convex cost case and that the same technique can be used to construct a polynomial time maximum mean cut canceling algorithm for submodular flow.
Author S. Thomas McCormick
Satoru Iwata
Maiko Shigeno
Author_xml – sequence: 1
  givenname: Satoru
  surname: Iwata
  fullname: Iwata, Satoru
– sequence: 2
  givenname: S. Thomas
  surname: McCormick
  fullname: McCormick, S. Thomas
– sequence: 3
  givenname: Maiko
  surname: Shigeno
  fullname: Shigeno, Maiko
BackLink https://cir.nii.ac.jp/crid/1873116917527209472$$DView record in CiNii
BookMark eNp9kE9LAzEQxYNUsNZ-AG9BvK5mNslmcyyLVaH-gep5yaabGskmNZtF-u3dUk8evMzAvPebB-8cTXzwLUKXQG4AqLjtSSk5KwlISQvglJ6gKRDJMwGsmKDpQc4O-hma971tCBECJOdkip4XeJ1i8Fu3x6_B7X3orHK4GhKulNets36LF24bok0fHTYh4ifrbTd0uAp9wuuh6cJmcCripQvfF-jUKNe38989Q-_Lu7fqIVu93D9Wi1WmaSFSphQpWU6Yoq2iSsoCikZoIRswbLznQkJhFOfGNLoURGw0kxttSilbnbcG6AxdHf_uYvga2j7Vn2GIfoysZc4LxiQjo0kcTTqGvo-tqbVNKtngU1TW1UDqQ331-m99Iwl_yF20nYr7f5nrI-OtHYMOE0pBAQoJguciJ5KJnP4A4yh80g
CitedBy_id crossref_primary_10_1007_s10107_006_0084_2
Cites_doi 10.1145/502090.502096
10.1002/net.3230230106
10.1007/BF01580882
10.1007/BF01589418
10.1016/S0020-0190(00)00052-1
10.1016/0166-218X(92)90231-X
10.1145/76359.76368
10.1007/s101070100253
10.1007/s101070050076
10.1006/jctb.2000.1989
10.1016/0167-6377(92)90048-8
10.1016/0095-8956(84)90029-7
10.1007/BF02592217
10.1007/BF02579369
10.1007/BF03167272
10.1145/48014.61051
10.1287/moor.25.1.76.15208
10.1007/978-3-642-97881-4
10.1287/moor.10.2.251
10.15807/jorsj.19.32
10.1016/S0167-6377(00)00059-6
10.1016/0166-218X(93)90025-J
10.1007/BF02579200
10.1007/s00493-003-0030-3
10.1287/moor.7.3.334
10.1137/S0097539794263695
10.1016/0196-6774(81)90032-8
10.1016/S0025-5610(96)00045-7
10.1016/0166-218X(92)00188-R
10.1287/moor.14.1.60
ContentType Journal Article
Copyright [Copyright] © 2005 Society for Industrial and Applied Mathematics
Copyright_xml – notice: [Copyright] © 2005 Society for Industrial and Applied Mathematics
DBID RYH
AAYXX
CITATION
3V.
7WY
7WZ
7X2
7XB
87Z
88A
88F
88I
88K
8AL
8FE
8FG
8FH
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KB.
L.-
L6V
LK8
M0C
M0K
M0N
M1Q
M2O
M2P
M2T
M7P
M7S
MBDVC
P5Z
P62
PATMY
PDBOC
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYCSY
Q9U
DOI 10.1137/s0895480199361533
DatabaseName CiNii Complete
CrossRef
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Agricultural Science Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Biology Database (Alumni Edition)
Military Database (Alumni Edition)
Science Database (Alumni Edition)
Telecommunications (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
Agricultural & Environmental Science Collection
ProQuest Central Essentials - QC
Biological Science Collection
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
Natural Science Collection
ProQuest One
ProQuest Materials Science Collection
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
Research Library Prep
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Materials Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Biological Sciences
ABI/INFORM Global
Agricultural Science Database
Computing Database
Military Database
Research Library
Science Database (via ProQuest SciTech Premium Collection)
Telecommunications Database
Biological Science Database
Engineering Database
Research Library (Corporate)
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
Environmental Science Database
Materials Science Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business (UW System Shared)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Environmental Science Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Agricultural Science Database
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Telecommunications
ProQuest One Applied & Life Sciences
Natural Science Collection
Biological Science Collection
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
Agricultural Science Collection
ProQuest Technology Collection
ProQuest Telecommunications (Alumni Edition)
Biological Science Database
ProQuest Business Collection
Environmental Science Collection
ProQuest One Academic UKI Edition
Environmental Science Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
Materials Science Collection
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Agricultural & Environmental Science Collection
Materials Science Database
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Materials Science Collection
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Agricultural Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1095-7146
EndPage 320
ExternalDocumentID 2599587031
10_1137_S0895480199361533
GroupedDBID .4S
.DC
123
4.4
6TJ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
AALVN
ABDBF
ABJCF
ABKAD
ABMZU
ABUWG
ACGFO
ACGOD
ACIWK
ACPRK
ACUHS
ADBBV
ADNWM
ADXHL
AENEX
AFFHD
AFFNX
AFKRA
AFRAH
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
CS3
CZ9
D1I
D1J
D1K
DQ2
DU5
DWQXO
EAP
EBS
EDO
EJD
EMK
EST
ESX
FRNLG
GNUQQ
GUQSH
H13
HCIFZ
H~9
I-F
K6-
K60
K6V
K6~
K7-
KB.
KC.
L6V
LK5
LK8
M0C
M0K
M1Q
M2O
M2P
M7P
M7R
M7S
P1Q
P2P
P62
PATMY
PDBOC
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
PYCSY
RJG
RSI
RYH
TN5
TUS
UQL
YNT
AASXH
AAYXX
ABDPE
CITATION
RNS
YYP
3V.
7XB
88A
88K
8AL
8FK
JQ2
L.-
M0N
M2T
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c367t-aa084204a3ea3a99616b7c79b1f442027916fa55ffbc8707dc49dcf899ec2ef13
IEDL.DBID M1Q
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000233579200004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0895-4801
IngestDate Wed Aug 20 23:41:55 EDT 2025
Sat Nov 29 05:36:59 EST 2025
Tue Nov 18 21:50:49 EST 2025
Mon Nov 10 09:09:22 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-aa084204a3ea3a99616b7c79b1f442027916fa55ffbc8707dc49dcf899ec2ef13
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 925644940
PQPubID 666311
PageCount 17
ParticipantIDs proquest_journals_925644940
crossref_citationtrail_10_1137_S0895480199361533
crossref_primary_10_1137_S0895480199361533
nii_cinii_1873116917527209472
PublicationCentury 2000
PublicationDate 2005-01-01
2005-01-00
20050101
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – month: 01
  year: 2005
  text: 2005-01-01
  day: 01
PublicationDecade 2000
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle SIAM Journal on Discrete Mathematics
PublicationYear 2005
Publisher Society for Industrial & Applied Mathematics (SIAM)
Society for Industrial and Applied Mathematics
Publisher_xml – name: Society for Industrial & Applied Mathematics (SIAM)
– name: Society for Industrial and Applied Mathematics
References Cui Wen‐Tian (R2) 1988; 31
R41
R21
R43
R20
R42
R45
R22
Iri M. (R23) 1976; 19
R44
R25
R24
R27
R28
R3
R5
R6
Fujishige Satoru (R16) 1991
R7
R8
R30
R10
R31
R12
R34
R11
R14
R36
R15
R18
R17
Fujishige Satoru (R13) 1978; 21
R19
References_xml – ident: R25
  doi: 10.1145/502090.502096
– ident: R6
  doi: 10.1002/net.3230230106
– ident: R15
  doi: 10.1007/BF01580882
– ident: R12
  doi: 10.1007/BF01589418
– ident: R27
  doi: 10.1016/S0020-0190(00)00052-1
– ident: R45
  doi: 10.1016/0166-218X(92)90231-X
– volume-title: Submodular functions and optimization
  year: 1991
  ident: R16
– ident: R20
  doi: 10.1145/76359.76368
– ident: R7
  doi: 10.1007/s101070100253
– ident: R44
  doi: 10.1007/s101070050076
– ident: R41
  doi: 10.1006/jctb.2000.1989
– ident: R22
  doi: 10.1016/0167-6377(92)90048-8
– ident: R10
  doi: 10.1016/0095-8956(84)90029-7
– ident: R14
  doi: 10.1007/BF02592217
– ident: R43
  doi: 10.1007/BF02579369
– ident: R17
  doi: 10.1007/BF03167272
– ident: R19
  doi: 10.1145/48014.61051
– ident: R42
  doi: 10.1287/moor.25.1.76.15208
– ident: R21
  doi: 10.1007/978-3-642-97881-4
– ident: R3
  doi: 10.1287/moor.10.2.251
– volume: 19
  start-page: 32
  issn: 0453-4514
  year: 1976
  ident: R23
  publication-title: J. Oper. Res. Soc. Japan
  doi: 10.15807/jorsj.19.32
– ident: R36
  doi: 10.1016/S0167-6377(00)00059-6
– ident: R5
  doi: 10.1016/0166-218X(93)90025-J
– ident: R11
  doi: 10.1007/BF02579200
– volume: 21
  start-page: 189
  year: 1978
  ident: R13
  publication-title: J. Oper. Res. Soc. Japan
– ident: R28
  doi: 10.1007/s00493-003-0030-3
– ident: R31
  doi: 10.1287/moor.7.3.334
– ident: R30
  doi: 10.1137/S0097539794263695
– ident: R8
  doi: 10.1016/0196-6774(81)90032-8
– ident: R24
  doi: 10.1016/S0025-5610(96)00045-7
– ident: R34
  doi: 10.1016/0166-218X(92)00188-R
– volume: 31
  start-page: 431
  year: 1988
  ident: R2
  publication-title: J. Oper. Res. Soc. Japan
– ident: R18
  doi: 10.1287/moor.14.1.60
SSID ssib007719550
ssib002241594
ssib007291826
ssib007291827
ssib007291828
ssib007461720
ssib000304405
ssib000480499
ssj0014415
Score 1.6567929
Snippet This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut...
SourceID proquest
crossref
nii
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 304
SubjectTerms Algorithms
Applied mathematics
Costs
Integer programming
Linear algebra
Mathematical programming
Optimization
Title A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
URI https://cir.nii.ac.jp/crid/1873116917527209472
https://www.proquest.com/docview/925644940
Volume 19
WOSCitedRecordID wos000233579200004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: 7WY
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M0C
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: P5Z
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Agricultural Science Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M0K
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/agriculturejournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M7P
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: K7-
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M7S
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Environmental Science Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: PATMY
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/environmentalscience
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Materials Science Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: KB.
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/materialsscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Military Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M1Q
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/military
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: BENPR
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library (Proquest)
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M2O
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1095-7146
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0014415
  issn: 0895-4801
  databaseCode: M2P
  dateStart: 19880201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3Nb9MwFH-iGwcujE-tG6t84IQUiB2njk-oi1YhTS2BDTG4RKkTj0hpsq0paP8973luJTRpFy4_JUqcRHn2-_Z7AG-1FDYOyzBAcYQGiipNUBRKoJVSoLIhkjIeG9dsQs3nycWFznxuzsqnVW54omPUZWfIR_5Bo2yWUsvw49V1QE2jKLjqO2gMYBf1ZE2l82f8yzaIQKaCUyJ1HFCVFB_U5BFVjE5cpTNKX3Mqzz9iadDW9T3e7ATOdO8_P_UZPPWaJpvcTY3n8KhqX8DeposD84v6Jcwn7Iz84ZfNLcu65pb2KeO4dN2zlKYE7Vdnk-YSX9H_WjJUctmsbuvlesnSbtUzZD3LrqRsVjZtuj-v4Nv05Dz9FPguC4GJxqpH0oSJFKEsoqqICjR_-HihjNILbqUk1wgqkLaIY2sXBhc3UlPq0li00yojKsuj17DTdm21D4yimpoj8ZMKFQMrtEVpZ6mpOk8WwoyHEG5-cm58CXLqhNHkzhSJVH6PLkN4tx1ydVd_46Gbj5By-GhCnqiIUykgFVOsWUslhnC4IVjul-oq31Lr4MGrh_DEVW113pc3sNPfrKsjeGx-9_XqZgQD9f3HCHaPT-bZVzw7VQHh8XvEWZg6PB256UkoPjvMHJ4TKneszhCz-Odfb87k2A
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT-MwEB7xWGm5AMvuivJaH-CyUrSJ49TxAaGqUIEKFRKsxC2bOjEbKU2ApqD-KP4jM25SCSFx48All8SWH19mvpmxZwD2leAmcBPXQXWEBopMtBPHkqOVEiPZ4GEStLUtNiEHg_DmRl0uwHNzF4aOVTYy0QrqpNTkI_-jUDcLoYR7dHfvUNEoCq42FTRmqOin0ye02MaHZ8e4vQec906uu6dOXVTA0X5bVjgSNxTcFbGfxn6MbN9rD6WWaugZIcgTgHzJxEFgzFAjlnHwQiXaoFmSap4az8d-F2FZ-KGk36ovnXnQgkwTS1pV4FBWljqI6vmUoTq0mdXouJylWK_U4GKRZW90gVVwvbVPtjTrsFozadaZQf8bLKTFBqw1VSpYLbS-w6DDrsjff5tP2WWZT-keNrbrTirWJcjTfXzWyW9xStX_EUMSzy6yIhtNRqxbjiuGonVUJnRal_Xy8ukH_P2QWf2EpaIs0k1gFLVVHoI7TJH4GK4ManNDReO9cMh1uwVus6mRrlOsU6WPPLKmli-jNzhowe95k7tZfpH3Pt5FpGDX9PQQgB6lOpIBxdKVkLwF2w1AoloUjaM5OrbeffsLvp5eX5xH52eD_jas2Ay11tO0A0vVwyTdhS_6scrGD3sW9Az-fTSUXgAXnzYt
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Strongly+Polynomial+Cut+Canceling+Algorithm+for+Minimum+Cost+Submodular+Flow&rft.jtitle=SIAM+journal+on+discrete+mathematics&rft.au=Iwata%2C+Satoru&rft.au=McCormick%2C+S.+Thomas&rft.au=Shigeno%2C+Maiko&rft.date=2005-01-01&rft.pub=Society+for+Industrial+and+Applied+Mathematics&rft.issn=0895-4801&rft.eissn=1095-7146&rft.volume=19&rft.issue=2&rft.spage=304&rft_id=info:doi/10.1137%2FS0895480199361533&rft.externalDocID=2599587031
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0895-4801&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0895-4801&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0895-4801&client=summon