{"id":"https://openalex.org/W1500396446","doi":"https://doi.org/10.1007/978-3-540-27810-8_24","title":"The Multi-multiway Cut Problem","display_name":"The Multi-multiway Cut Problem","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1500396446","doi":"https://doi.org/10.1007/978-3-540-27810-8_24","mag":"1500396446"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27810-8_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_24","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/A5091391628","display_name":"Adi Avidor","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Adi Avidor","raw_affiliation_strings":["School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011741113","display_name":"Michael Langberg","orcid":"https://orcid.org/0000-0002-7470-0718"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Langberg","raw_affiliation_strings":["Department of Computer Science, California Institute of Technology, Pasadena, California, 91125"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, California Institute of Technology, Pasadena, California, 91125","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1014,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.77071179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"284"},"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.9972000122070312,"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.9972000122070312,"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/T12288","display_name":"Optimization and Search Problems","score":0.9621999859809875,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9373000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.7096388936042786},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6070379614830017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5565546751022339},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5258774757385254},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4896745979785919},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.452398419380188},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4351847767829895},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.43270424008369446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40672022104263306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.294670045375824},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.22505995631217957}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7096388936042786},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6070379614830017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5565546751022339},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5258774757385254},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4896745979785919},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.452398419380188},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4351847767829895},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.43270424008369446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40672022104263306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.294670045375824},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.22505995631217957},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-27810-8_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_24","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":[{"score":0.41999998688697815,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1500938493","https://openalex.org/W1511938660","https://openalex.org/W1981960292","https://openalex.org/W1985123706","https://openalex.org/W1992520677","https://openalex.org/W2002531683","https://openalex.org/W2006933117","https://openalex.org/W2008362572","https://openalex.org/W2008475686","https://openalex.org/W2038225707","https://openalex.org/W2040831377","https://openalex.org/W2044343300","https://openalex.org/W2070745908","https://openalex.org/W2096411231","https://openalex.org/W2101407539","https://openalex.org/W2109039359","https://openalex.org/W2133017912","https://openalex.org/W2143654071","https://openalex.org/W2145437676","https://openalex.org/W2148177011","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W2561675875","https://openalex.org/W3009415557","https://openalex.org/W4213060883","https://openalex.org/W4235946010","https://openalex.org/W4245266864"],"related_works":["https://openalex.org/W2593080689","https://openalex.org/W1991979416","https://openalex.org/W2254726702","https://openalex.org/W2395976569","https://openalex.org/W276709744","https://openalex.org/W1966079129","https://openalex.org/W2117839333","https://openalex.org/W4234897719","https://openalex.org/W4376639517","https://openalex.org/W2147954430"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}