{"id":"https://openalex.org/W2159018822","doi":"https://doi.org/10.1007/s10107-004-0517-8","title":"Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs","display_name":"Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs","publication_year":2004,"publication_date":"2004-06-05","ids":{"openalex":"https://openalex.org/W2159018822","doi":"https://doi.org/10.1007/s10107-004-0517-8","mag":"2159018822"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-004-0517-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0517-8","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5019541925","display_name":"Ramkumar Ramaswamy","orcid":null},"institutions":[{"id":"https://openalex.org/I110675161","display_name":"Infosys (India)","ror":"https://ror.org/03bs18y54","country_code":"IN","type":"company","lineage":["https://openalex.org/I110675161"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ramkumar Ramaswamy","raw_affiliation_strings":["Infosys Technologies Limited, 3rd Cross, Electronics City, Bangalore, 561 229, India"],"affiliations":[{"raw_affiliation_string":"Infosys Technologies Limited, 3rd Cross, Electronics City, Bangalore, 561 229, India","institution_ids":["https://openalex.org/I110675161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["MIT E40-147, Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"MIT E40-147, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077825111","display_name":"Nilopal Chakravarti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nilopal Chakravarti","raw_affiliation_strings":["Ortec Asia, 30 Cecil Street, Singapore, 049712"],"affiliations":[{"raw_affiliation_string":"Ortec Asia, 30 Cecil Street, Singapore, 049712","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019541925"],"corresponding_institution_ids":["https://openalex.org/I110675161"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.3936,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.82346521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"102","issue":"2","first_page":"355","last_page":"369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9957000017166138,"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/mathematics","display_name":"Mathematics","score":0.8147618770599365},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7411880493164062},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.6920073628425598},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.6655181646347046},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6529229283332825},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6228886246681213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5719980001449585},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5592989921569824},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45336630940437317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4510922431945801},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.41767364740371704},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32902127504348755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13248780369758606}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8147618770599365},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7411880493164062},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.6920073628425598},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.6655181646347046},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6529229283332825},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6228886246681213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5719980001449585},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5592989921569824},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45336630940437317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4510922431945801},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.41767364740371704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32902127504348755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13248780369758606},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-004-0517-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0517-8","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1947899203","https://openalex.org/W1977545325","https://openalex.org/W1980943820","https://openalex.org/W1991295190","https://openalex.org/W2000869287","https://openalex.org/W2009072875","https://openalex.org/W2022363559","https://openalex.org/W2025643847","https://openalex.org/W2034581303","https://openalex.org/W2048500523","https://openalex.org/W2066939362","https://openalex.org/W2078199146","https://openalex.org/W2084224084","https://openalex.org/W2096594665","https://openalex.org/W2113906664","https://openalex.org/W2115490543","https://openalex.org/W2118681568","https://openalex.org/W2134729426","https://openalex.org/W2138304862","https://openalex.org/W2139610344","https://openalex.org/W2149342630","https://openalex.org/W2752885492","https://openalex.org/W4243833241","https://openalex.org/W4245095675","https://openalex.org/W4249771745","https://openalex.org/W4252979032"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2020255949","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2375775343","https://openalex.org/W4299588719","https://openalex.org/W4210697296","https://openalex.org/W2361081252"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}