{"id":"https://openalex.org/W2079511862","doi":"https://doi.org/10.1080/1055678031000099178","title":"Capacity scaling algorithm for scalable M-convex submodular flow problems","display_name":"Capacity scaling algorithm for scalable M-convex submodular flow problems","publication_year":2003,"publication_date":"2003-04-01","ids":{"openalex":"https://openalex.org/W2079511862","doi":"https://doi.org/10.1080/1055678031000099178","mag":"2079511862"},"language":"en","primary_location":{"id":"doi:10.1080/1055678031000099178","is_oa":false,"landing_page_url":"https://doi.org/10.1080/1055678031000099178","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016777657","display_name":"Satoko Moriguchi","orcid":"https://orcid.org/0000-0003-0105-7167"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Satoko Moriguchi","raw_affiliation_strings":["Graduate School of Information Science and Engineering , Tokyo Institute of Technology , Tokyo, Japan , 152-8552","Tokyo Inst. of Tech"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Engineering , Tokyo Institute of Technology , Tokyo, Japan , 152-8552","institution_ids":["https://openalex.org/I114531698"]},{"raw_affiliation_string":"Tokyo Inst. of Tech","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032957138","display_name":"Kazuo Murota","orcid":"https://orcid.org/0000-0003-1518-9152"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuo Murota","raw_affiliation_strings":["Graduate School of Information Science and Technology , University of Tokyo , Tokyo, Japan , 113-8656","university of Tokyo;"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology , University of Tokyo , Tokyo, Japan , 113-8656","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"university of Tokyo;","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016777657"],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":null,"apc_paid":null,"fwci":1.4538,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82280777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"2","first_page":"207","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8857613801956177},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6093264222145081},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6038990020751953},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5993025898933411},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5043543577194214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49987077713012695},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4754466712474823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4551820456981659},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3752165138721466},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07407033443450928}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8857613801956177},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6093264222145081},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6038990020751953},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5993025898933411},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5043543577194214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49987077713012695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4754466712474823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4551820456981659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3752165138721466},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07407033443450928},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/1055678031000099178","is_oa":false,"landing_page_url":"https://doi.org/10.1080/1055678031000099178","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.7726","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.is.titech.ac.jp/research/research-report/B/B-385.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.592.4568","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.4568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.keisu.t.u-tokyo.ac.jp/research/techrep/data/2002/METR02-15.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1576820654","https://openalex.org/W1604158939","https://openalex.org/W2000317174","https://openalex.org/W2035186046","https://openalex.org/W2042275390","https://openalex.org/W2050548031","https://openalex.org/W2056006039","https://openalex.org/W2061647611","https://openalex.org/W2068200970","https://openalex.org/W2070580226","https://openalex.org/W2071642760","https://openalex.org/W2149342630","https://openalex.org/W2155598645","https://openalex.org/W2158486393","https://openalex.org/W2304678994","https://openalex.org/W3138620896"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2966531942","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W4386185001","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W4313349366","https://openalex.org/W3141561286"],"abstract_inverted_index":{"An":[0],"M-convex":[1,19,64,83,89,105],"function":[2,7,90],"is":[3,23,94,103],"a":[4,57,76],"nonlinear":[5],"discrete":[6],"defined":[8],"on":[9,75],"integer":[10,109,115],"points":[11],"introduced":[12],"by":[13],"Murota":[14],"in":[15],"1996,":[16],"and":[17,42,113],"the":[18,26,38,43,63,81],"submodular":[20,44,65,84],"flow":[21,41,45,66,85],"problem":[22],"one":[24],"of":[25,30],"most":[27],"general":[28],"frameworks":[29],"efficiently":[31],"solvable":[32],"combinatorial":[33],"optimization":[34],"problems.":[35],"It":[36],"includes":[37],"minimum":[39],"cost":[40],"problems":[46],"as":[47],"its":[48],"special":[49],"cases.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"first":[55],"devise":[56],"successive":[58],"shortest":[59],"path":[60],"algorithm":[61,73],"for":[62,80,106],"problem.":[67,86],"We":[68],"then":[69],"propose":[70],"an":[71,88],"efficient":[72],"based":[74],"capacity":[77],"scaling":[78],"framework":[79],"scalable":[82,98],"Here":[87],"[Formula:":[91,100,110],"See":[92,101,111],"Text]":[93,102,112],"said":[95],"to":[96],"be":[97],"if":[99],"also":[104],"any":[107,114],"positive":[108],"vector":[116],"b.":[117]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}