{"id":"https://openalex.org/W2901824585","doi":"https://doi.org/10.1007/978-3-030-04651-4_42","title":"Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem","display_name":"Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2901824585","doi":"https://doi.org/10.1007/978-3-030-04651-4_42","mag":"2901824585"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-04651-4_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5086269144","display_name":"Mark Velednitsky","orcid":"https://orcid.org/0000-0003-1176-5159"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mark Velednitsky","raw_affiliation_strings":["University of California, Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0003-1176-5159","affiliations":[{"raw_affiliation_string":"University of California, Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["University of California, Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0002-2498-0512","affiliations":[{"raw_affiliation_string":"University of California, Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086269144"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9737,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.881087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"624","last_page":"639"},"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.9987999796867371,"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.9987999796867371,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6662853956222534},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6523439288139343},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6032917499542236},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5409544110298157},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5174061059951782},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47697004675865173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4761395752429962},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47525808215141296},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.46626147627830505},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.4518222510814667},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4415401518344879},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4147719740867615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3691573739051819},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3366728127002716}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6662853956222534},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6523439288139343},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6032917499542236},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5409544110298157},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5174061059951782},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47697004675865173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4761395752429962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47525808215141296},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.46626147627830505},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.4518222510814667},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4415401518344879},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4147719740867615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3691573739051819},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3366728127002716},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-04651-4_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1552561242","https://openalex.org/W1967761844","https://openalex.org/W1983275606","https://openalex.org/W1990313671","https://openalex.org/W2008475686","https://openalex.org/W2060121592","https://openalex.org/W2070232376","https://openalex.org/W2086937160","https://openalex.org/W2096139825","https://openalex.org/W2119378898","https://openalex.org/W2132022337","https://openalex.org/W2132805234","https://openalex.org/W2152986618","https://openalex.org/W2167236203","https://openalex.org/W2167637346","https://openalex.org/W2185814067","https://openalex.org/W2709134661","https://openalex.org/W2996735613","https://openalex.org/W3121576764"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2769220156","https://openalex.org/W4252122881","https://openalex.org/W2024753861","https://openalex.org/W2568448495","https://openalex.org/W2081493497","https://openalex.org/W2218893665","https://openalex.org/W2084009144","https://openalex.org/W4210268737","https://openalex.org/W2366969645"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}