{"id":"https://openalex.org/W2463317516","doi":"https://doi.org/10.1007/s10287-016-0260-7","title":"On the minimum-cost $$\\lambda $$ \u03bb -edge-connected k-subgraph problem","display_name":"On the minimum-cost $$\\lambda $$ \u03bb -edge-connected k-subgraph problem","publication_year":2016,"publication_date":"2016-06-21","ids":{"openalex":"https://openalex.org/W2463317516","doi":"https://doi.org/10.1007/s10287-016-0260-7","mag":"2463317516"},"language":"en","primary_location":{"id":"doi:10.1007/s10287-016-0260-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10287-016-0260-7","pdf_url":null,"source":{"id":"https://openalex.org/S28822639","display_name":"Computational Management Science","issn_l":"1619-697X","issn":["1619-697X","1619-6988"],"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":"Computational Management Science","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/A5070619606","display_name":"Elham Sadeghi","orcid":"https://orcid.org/0000-0002-1258-8556"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Elham Sadeghi","raw_affiliation_strings":["Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 85721, USA"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 85721, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017037570","display_name":"Neng Fan","orcid":"https://orcid.org/0000-0003-4333-3721"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neng Fan","raw_affiliation_strings":["Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 85721, USA"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 85721, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070619606"],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0787,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.80088825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"13","issue":"4","first_page":"571","last_page":"596"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8629226684570312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7279612421989441},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7140432596206665},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.684939444065094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6748309135437012},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5461035370826721},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5306942462921143},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4903686046600342},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4688960909843445},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45682457089424133},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.44303321838378906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42885372042655945},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.42241552472114563},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4155849814414978},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21063101291656494},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1189740002155304},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.11777171492576599},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05996468663215637}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8629226684570312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7279612421989441},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7140432596206665},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.684939444065094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6748309135437012},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5461035370826721},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5306942462921143},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4903686046600342},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4688960909843445},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45682457089424133},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.44303321838378906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42885372042655945},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.42241552472114563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4155849814414978},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21063101291656494},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1189740002155304},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.11777171492576599},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05996468663215637},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10287-016-0260-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10287-016-0260-7","pdf_url":null,"source":{"id":"https://openalex.org/S28822639","display_name":"Computational Management Science","issn_l":"1619-697X","issn":["1619-697X","1619-6988"],"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":"Computational Management Science","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:comgts:v:13:y:2016:i:4:d:10.1007_s10287-016-0260-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10287-016-0260-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W68141807","https://openalex.org/W976211528","https://openalex.org/W1574619705","https://openalex.org/W1969675191","https://openalex.org/W1994247939","https://openalex.org/W1999799345","https://openalex.org/W2006909611","https://openalex.org/W2011039300","https://openalex.org/W2020163691","https://openalex.org/W2023507829","https://openalex.org/W2038190710","https://openalex.org/W2045428711","https://openalex.org/W2049245301","https://openalex.org/W2051699458","https://openalex.org/W2089135840","https://openalex.org/W2092113566","https://openalex.org/W2098904848","https://openalex.org/W2102671623","https://openalex.org/W2139547379","https://openalex.org/W2148178939","https://openalex.org/W2159586130","https://openalex.org/W2161190897","https://openalex.org/W2172955861","https://openalex.org/W2335132016","https://openalex.org/W2401610261","https://openalex.org/W3149604617","https://openalex.org/W4240507476","https://openalex.org/W4247103873","https://openalex.org/W4250567655","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W3008959778","https://openalex.org/W2288163449","https://openalex.org/W2032950096","https://openalex.org/W4300575715","https://openalex.org/W1533352539","https://openalex.org/W176100319","https://openalex.org/W4381707488","https://openalex.org/W1594283629","https://openalex.org/W2153952206"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}