A faster capacity scaling algorithm for minimum cost submodular flow

We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a re...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming Ročník 92; číslo 1; s. 119 - 139
Hlavní autoři: Fleischer, Lisa, Iwata, Satoru, McCormick, S. Thomas
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer Nature B.V 01.03.2002
Témata:
Algorithms
ISSN:0025-5610, 1436-4646
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter [delta]. Capacities are relaxed by attaching a complete directed graph with uniform arc capacity [delta] in each scaling phase. We then modify a feasible submodular flow by relaxing the submodular constraints, so that complementary slackness is satisfied. This creates discrepancies between the boundary of the flow and the base polyhedron of a relaxed submodular function. To reduce these discrepancies, we use a variant of the successive shortest path algorithm that augments flow along minimum cost paths of residual capacity at least [delta]. The shortest augmenting path subroutine we use is a variant of Dijkstra's algorithm modified to handle exchange capacity arcs efficiently. The result is a weakly polynomial time algorithm whose running time is better than any existing submodular flow algorithm when U is small and C is big. We also show how to use maximum mean cuts to make the algorithm strongly polynomial. The resulting algorithm is the first capacity scaling algorithm to match the current best strongly polynomial bound for submodular flow.
AbstractList We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter [delta]. Capacities are relaxed by attaching a complete directed graph with uniform arc capacity [delta] in each scaling phase. We then modify a feasible submodular flow by relaxing the submodular constraints, so that complementary slackness is satisfied. This creates discrepancies between the boundary of the flow and the base polyhedron of a relaxed submodular function. To reduce these discrepancies, we use a variant of the successive shortest path algorithm that augments flow along minimum cost paths of residual capacity at least [delta]. The shortest augmenting path subroutine we use is a variant of Dijkstra's algorithm modified to handle exchange capacity arcs efficiently. The result is a weakly polynomial time algorithm whose running time is better than any existing submodular flow algorithm when U is small and C is big. We also show how to use maximum mean cuts to make the algorithm strongly polynomial. The resulting algorithm is the first capacity scaling algorithm to match the current best strongly polynomial bound for submodular flow.
Author Iwata, Satoru
Fleischer, Lisa
McCormick, S. Thomas
Author_xml – sequence: 1
  givenname: Lisa
  surname: Fleischer
  fullname: Fleischer, Lisa
– sequence: 2
  givenname: Satoru
  surname: Iwata
  fullname: Iwata, Satoru
– sequence: 3
  givenname: S. Thomas
  surname: McCormick
  fullname: McCormick, S. Thomas
BookMark eNp1UE1LxDAUDLKCu6tH78F79SVp0_a4rJ-w4EXP5TVt1ixtU5MU2X9vynpR8PAYeMwHMyuyGOzQEnLN4JYB5HeeAYM8HvBMnJElS4VMUpnKBVnOvySTDC7IyvsDADBRFEtyv6EafWgdVTiiMuFIvcLODHuK3d46Ez56qq2jvRlMP_VUWR-on-reNlOHjurOfl2Sc42db69-cE3eHx_ets_J7vXpZbvZJUrwIiSKay5y2eStTEuua0BRa8lZXugMa1XIUrOCQ4oyE2WuslJBMzdiDZdagBBrcnPyHZ39nFofqoOd3BAjKx4TMh7NIkmcSMpZ712rq9gKg7FDcGi6ikE1r1X9Wiuqkj-q0Zke3fEf_jdFWms4
CODEN MHPGA4
CitedBy_id crossref_primary_10_1080_02533839_2013_815010
crossref_primary_10_1287_moor_2018_0976
crossref_primary_10_1007_s10107_006_0084_2
crossref_primary_10_1109_TMC_2007_70743
crossref_primary_10_1007_s10107_004_0562_3
crossref_primary_10_1137_S0097539701397813
crossref_primary_10_1137_S0895480199361533
crossref_primary_10_1145_502090_502096
crossref_primary_10_1109_JIOT_2023_3270436
crossref_primary_10_1007_s13160_012_0084_y
ContentType Journal Article
Copyright Copyright Springer-Verlag 2002
Copyright_xml – notice: Copyright Springer-Verlag 2002
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L.0
L6V
L7M
L~C
L~D
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s101070100253
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
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
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Professional Standard
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1436-4646
EndPage 139
ExternalDocumentID 703727711
10_1007_s101070100253
GroupedDBID --Z
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1OL
1SB
203
29M
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
6TJ
78A
7WY
88I
8AO
8FE
8FG
8FL
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDBF
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACSTC
ACUHS
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADXHL
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMOZ
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFFHD
AFGCZ
AFHIU
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHQJS
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMVHM
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
AZQEC
B-.
B0M
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CCPQU
CITATION
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EAD
EAP
EBA
EBLON
EBR
EBS
EBU
ECS
EDO
EIOEI
EJD
EMI
EMK
EPL
ESBYG
EST
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IAO
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
L6V
LAS
LLZTM
M0C
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9R
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R89
R9I
RHV
RNS
ROL
RPX
RSV
S16
S27
S3B
SAP
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
XPP
YLTOR
Z45
ZL0
ZMTXR
~02
~8M
~EX
3V.
7SC
7XB
8AL
8FD
8FK
AAYZH
AESKC
JQ2
L.-
L.0
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
PUEGO
Q9U
ID FETCH-LOGICAL-c328t-c2f2376d7e6492fb0a3bf62178f5abc869f18204a65397c59c0d01071d26f3033
IEDL.DBID 7WY
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000174872700005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0025-5610
IngestDate Thu Sep 25 00:34:13 EDT 2025
Sat Nov 29 05:48:50 EST 2025
Tue Nov 18 22:20:55 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c328t-c2f2376d7e6492fb0a3bf62178f5abc869f18204a65397c59c0d01071d26f3033
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 232852621
PQPubID 25307
PageCount 21
ParticipantIDs proquest_journals_232852621
crossref_citationtrail_10_1007_s101070100253
crossref_primary_10_1007_s101070100253
PublicationCentury 2000
PublicationDate 2002-3-1
20020301
PublicationDateYYYYMMDD 2002-03-01
PublicationDate_xml – month: 03
  year: 2002
  text: 2002-3-1
  day: 01
PublicationDecade 2000
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Mathematical programming
PublicationYear 2002
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
SSID ssj0001388
Score 1.7344829
Snippet We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 119
SubjectTerms Algorithms
Title A faster capacity scaling algorithm for minimum cost submodular flow
URI https://www.proquest.com/docview/232852621
Volume 92
WOSCitedRecordID wos000174872700005&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: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: 7WY
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M0C
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: P5Z
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: K7-
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M7S
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: BENPR
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database (ProQuest)
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M2P
  dateStart: 20011001
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLink Journals
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagZYCBN6IUkAfERERejpMJ8ShCQlQV5b1Ejh0DUtuUJoW_z11wShlgYTnJykmxfM595-TyfYTsMY9rV0huMU8wy8caTjg-Njl6ti3TRIValGITvN0OHx6ijunNyU1bZZUTy0StMonvyA8B-UPmBq5zNHyzUDQKP64aBY1ZUgecZihgwO8fJ4nY8cKwUmzFMsFQbJo_5-DcYyP_KPN-QtLPjFzCzPnSPye4TBZNfUmPvzbECplJB6tkYYp1EEZXE6rWfI2cHVMtkC2BSsBNCUU5zSFu4ElF7xnuULz0KVS2FElI-uM-lVle0BxgNFPYwkp1L_tYJ7fnrZvTC8tIK1gSpllY0tXYDqN4GviRqxNbeImGufNQM5HIMIg0Mrv7AplruWSRtBWumKPcQAPqeRukNsgG6SahiUw4d3wWKSit3MiJUi1S7SvJFRyleNggB9XqxtLwjqP8RS_-ZkyeCkaD7E_ch1-EG785Nqs4xOa5y-NJELb-vNok86WqS9lLtk1qxWic7pA5-V685qPdchftkvpJq925htElt8Be2ado3Q5a3gXbYU9gr7t3n7Qy1FA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V25TsQwEB1xSUDBjYDlcAFURCTOYadAaMUh0B6iAIkuOHYMSLsbIFlWfBT_yDibLFBAR0EZxRrJmcnMm2T8HsCu7zJNhWSW7wrf8gyGE45nhhxd25ZJrLgWhdgEa7f57W14NQbv1VkYM1ZZ5cQiUatUmm_kh1j5uU8D6hw_PVtGNMr8XK0UNIZR0UjeBtixZUeXp-jePUrPz65PLqxSVMCSaCG3JNVmEESxJPBCqmNbuLFGs4xrX8SSB6E2nOaeMJytTPqhtBX2LMxRNNCY7120Ow6TnssD80I1mDVK_I7LeaUQa2BJSelZntRDG7bhO_Xd7yXwewUoytr5_D97IAswV-JnUh8G_CKMJb0lmP3CqohXrREVbbYMp3WihWGDIBJxgcSmg2QYl7iSiM497ih_6BJE7sSQrHT7XSLTLCcZwoRUmRFdojvpYAVu_mRTqzDRS3vJGpBYxow5nh8qhI40dMJEi0R7SjKFrSLj63BQeTOSJa-6kffoRJ-M0F-cvw77o-VPQ0KRnxbWKr9HZV7JopHTN369uwPTF9etZtS8bDdqMFMo2BRzc5swkb_0ky2Ykq_5Y_ayXUQwgbu_jpAP4HgnAg
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+faster+capacity+scaling+algorithm+for+minimum+cost+submodular+flow&rft.jtitle=Mathematical+programming&rft.au=Fleischer%2C+Lisa&rft.au=Iwata%2C+Satoru&rft.au=McCormick%2C+S+Thomas&rft.date=2002-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=92&rft.issue=1&rft.spage=119&rft_id=info:doi/10.1007%2Fs101070100253&rft.externalDocID=703727711
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon