{"id":"https://openalex.org/W2116729599","doi":"https://doi.org/10.1007/11424925_71","title":"The Capacitated max-k-cut Problem","display_name":"The Capacitated max-k-cut Problem","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2116729599","doi":"https://doi.org/10.1007/11424925_71","mag":"2116729599"},"language":"en","primary_location":{"id":"doi:10.1007/11424925_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11424925_71","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":"conference-paper","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/A5050039766","display_name":"Daya Ram Gaur","orcid":"https://orcid.org/0000-0001-6876-6000"},"institutions":[{"id":"https://openalex.org/I107949126","display_name":"University of Lethbridge","ror":"https://ror.org/044j76961","country_code":"CA","type":"education","lineage":["https://openalex.org/I107949126"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Daya Ram Gaur","raw_affiliation_strings":["Department of Math & Computer Sc, University of Lethbridge, Lethbridge, AB, T1K 4G9"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Math & Computer Sc, University of Lethbridge, Lethbridge, AB, T1K 4G9","institution_ids":["https://openalex.org/I107949126"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014255932","display_name":"Ramesh Krishnamurti","orcid":"https://orcid.org/0000-0001-6327-8286"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ramesh Krishnamurti","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, BC, V5A 1S6"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, BC, V5A 1S6","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7904,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70807453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"670","last_page":"679"},"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.9997000098228455,"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.9997000098228455,"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.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.9968000054359436,"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/maximum-cut","display_name":"Maximum cut","score":0.756924033164978},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6275986433029175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5877903699874878},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5628512501716614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5459725260734558},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5457848310470581},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45541146397590637},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4288569986820221},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4160747230052948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3902125954627991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34110909700393677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32773324847221375},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1392359435558319}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.756924033164978},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6275986433029175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5877903699874878},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5628512501716614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5459725260734558},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5457848310470581},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45541146397590637},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4288569986820221},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4160747230052948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3902125954627991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34110909700393677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32773324847221375},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1392359435558319}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11424925_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11424925_71","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W99679382","https://openalex.org/W1601503375","https://openalex.org/W1985123706","https://openalex.org/W2043506441","https://openalex.org/W2063046368","https://openalex.org/W2074617595","https://openalex.org/W2086917808","https://openalex.org/W2611804663","https://openalex.org/W4249318479","https://openalex.org/W4387967785"],"related_works":["https://openalex.org/W2583811263","https://openalex.org/W3190829980","https://openalex.org/W3211941742","https://openalex.org/W3173312668","https://openalex.org/W2810695303","https://openalex.org/W3012931947","https://openalex.org/W2035944803","https://openalex.org/W2745252358","https://openalex.org/W3165634411","https://openalex.org/W4297063357"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}