{"id":"https://openalex.org/W164466715","doi":null,"title":"Incremental Algorithms for the Minimum Cost Flow Problem","display_name":"Incremental Algorithms for the Minimum Cost Flow Problem","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W164466715","mag":"164466715"},"language":"en","primary_location":{"id":"mag:164466715","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=2028299.2028341","pdf_url":null,"source":{"id":"https://openalex.org/S4306417674","display_name":"Annual Conference on Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Annual Conference on Computers","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5010950189","display_name":"Laura Ciupal\u0103","orcid":"https://orcid.org/0009-0006-2059-3466","observed_orcids":["https://orcid.org/0009-0006-2059-3466"]},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transilvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Laura Ciupal\u0103","raw_affiliation_strings":["Department of Computer Science, University Transilvania of Brasov, Brasov, Romania"],"raw_orcid":"https://orcid.org/0009-0006-2059-3466","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University Transilvania of Brasov, Brasov, Romania","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5141828357","display_name":"Iuliu Maniu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iuliu Maniu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010950189"],"corresponding_institution_ids":["https://openalex.org/I3123573182"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12709","display_name":"Optimization and Mathematical Programming","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.843999981880188},{"id":"https://openalex.org/keywords/incremental-algorithms","display_name":"incremental algorithms","score":0.9950000047683716},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.7440000176429749},{"id":"https://openalex.org/keywords/dynamic-network-optimization","display_name":"dynamic network optimization","score":0.5320000052452087},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.875}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.8925792574882507},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7430261969566345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6737470030784607},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6479204893112183},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6098364591598511},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5771237015724182},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.523735523223877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46473100781440735},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4577151834964752},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4367789924144745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21856984496116638},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:164466715","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=2028299.2028341","pdf_url":null,"source":{"id":"https://openalex.org/S4306417674","display_name":"Annual Conference on Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Annual Conference on Computers","raw_type":null},{"id":"mag:3207627914","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/conferences/2011/Corfu/COMPUTERS/COMPUTERS-35.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W89936677","https://openalex.org/W1548164611","https://openalex.org/W1977545325","https://openalex.org/W2061404140","https://openalex.org/W2071419879","https://openalex.org/W3142422805"],"related_works":["https://openalex.org/W3159013657","https://openalex.org/W7097636260","https://openalex.org/W1545030848","https://openalex.org/W45690793","https://openalex.org/W3000607354","https://openalex.org/W7101029263","https://openalex.org/W2277971128","https://openalex.org/W1977847591","https://openalex.org/W7220822039","https://openalex.org/W2399852871"],"abstract_inverted_index":{"Incremental":[0],"algorithms":[1],"may":[2],"save":[3],"computational":[4],"time":[5],"to":[6],"solve":[7,29],"different":[8],"network":[9,16,40],"flow":[10,37],"problems.":[11],"Let":[12],"us":[13],"consider":[14],"a":[15,22,34,43],"in":[17,38,60],"which":[18],"we":[19],"already":[20],"established":[21],"minimum":[23,35],"cost":[24,36],"flow.":[25],"We":[26,52],"describe":[27],"and":[28,46],"the":[30],"problem":[31],"of":[32],"establishing":[33],"this":[39],"after":[41,47],"inserting":[42],"new":[44],"arc":[45],"deleting":[48],"an":[49],"existent":[50],"arc.":[51],"focus":[53],"on":[54],"these":[55],"problems":[56],"because":[57],"they":[58],"arise":[59],"practice.":[61]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-22T18:32:59.640997","created_date":"2016-06-24T00:00:00"}