{"id":"https://openalex.org/W2081846387","doi":"https://doi.org/10.1007/s004530010013","title":"Approximation Algorithms for Minimum K -Cut","display_name":"Approximation Algorithms for Minimum K -Cut","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W2081846387","doi":"https://doi.org/10.1007/s004530010013","mag":"2081846387"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010013","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010013","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5007201064","display_name":"Nili Guttmann\u2010Beck","orcid":"https://orcid.org/0000-0001-7171-3188"},"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":"N. Guttmann-Beck","raw_affiliation_strings":["Department of Statistics  and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel.  nili@math.tau.ac.il, hassin@math.tau.ac.il.\n, , , , , , IL","Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel. nili@math.tau.ac.il,  hassin@math.tau.ac.il., , IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics  and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel.  nili@math.tau.ac.il, hassin@math.tau.ac.il.\n, , , , , , IL","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel. nili@math.tau.ac.il,  hassin@math.tau.ac.il., , IL","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022008503","display_name":"Refael Hassin","orcid":"https://orcid.org/0000-0001-9631-6162"},"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":"R. Hassin","raw_affiliation_strings":["Department of Statistics  and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel.  nili@math.tau.ac.il, hassin@math.tau.ac.il.\n, , , , , , IL","Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel. nili@math.tau.ac.il,  hassin@math.tau.ac.il., , IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics  and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel.  nili@math.tau.ac.il, hassin@math.tau.ac.il.\n, , , , , , IL","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel. nili@math.tau.ac.il,  hassin@math.tau.ac.il., , IL","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7821,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.77753223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"2","first_page":"198","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9991999864578247,"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/combinatorics","display_name":"Combinatorics","score":0.8515113592147827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.812009334564209},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6718093752861023},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6079025268554688},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5978931188583374},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5800751447677612},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5503767728805542},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.5196982026100159},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49055951833724976},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48394230008125305},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4801699221134186},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4111118018627167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2608395218849182}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8515113592147827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.812009334564209},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6718093752861023},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6079025268554688},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5978931188583374},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5800751447677612},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5503767728805542},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.5196982026100159},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49055951833724976},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48394230008125305},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4801699221134186},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4111118018627167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2608395218849182}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s004530010013","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010013","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1989070206","https://openalex.org/W2011039300","https://openalex.org/W2122466336","https://openalex.org/W2167637346"],"related_works":["https://openalex.org/W2025698306","https://openalex.org/W1481223916","https://openalex.org/W2056179869","https://openalex.org/W2149302127","https://openalex.org/W2035448415","https://openalex.org/W1850573590","https://openalex.org/W2561136735","https://openalex.org/W1950827710","https://openalex.org/W1482102823","https://openalex.org/W2583914519"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}