{"id":"https://openalex.org/W2002805364","doi":"https://doi.org/10.1016/s0020-0190(96)00175-5","title":"Approximating the maximally balanced connected partition problem in graphs","display_name":"Approximating the maximally balanced connected partition problem in graphs","alternate_titles":[],"publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W2002805364","doi":"https://doi.org/10.1016/s0020-0190(96)00175-5","mag":"2002805364"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(96)00175-5","doi":"https://doi.org/10.1016/s0020-0190(96)00175-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(96)00175-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2002805364"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5061610147","display_name":"Janka Chleb\u00edkov\u00e1","orcid":"https://orcid.org/0000-0002-9493-2049","observed_orcids":["https://orcid.org/0000-0002-9493-2049"]},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Janka Chleb\u00edkov\u00e1","raw_affiliation_strings":["Department of Informatics Education, Faculty of Mathematics and Physics, Comenius University, Mlynsk\u00e1 dolina, 842 15 Bratislava, Slovak Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics Education, Faculty of Mathematics and Physics, Comenius University, Mlynsk\u00e1 dolina, 842 15 Bratislava, Slovak Republic","institution_ids":["https://openalex.org/I74788687"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061610147"],"corresponding_institution_ids":["https://openalex.org/I74788687"],"apc_list":{"value":2590,"currency":"USD","value_usd":2590},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":110,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"60","issue":"5","first_page":"225","last_page":"230"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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.9990000128746033,"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.0010000000474974513,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.8730000257492065},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7739999890327454},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9340000152587891},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.7609999775886536},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.4909999966621399},{"id":"https://openalex.org/keywords/connected-subgraphs","display_name":"connected subgraphs","score":0.45399999618530273}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7748315334320068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7630336284637451},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6520683169364929},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6470437049865723},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5972957015037537},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5139712691307068},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5057773590087891},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4634203016757965},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.45777249336242676},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44031697511672974},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4339800477027893},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34437263011932373}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(96)00175-5","doi":"https://doi.org/10.1016/s0020-0190(96)00175-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(96)00175-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2079828065","https://openalex.org/W2174799808","https://openalex.org/W6685129916"],"related_works":["https://openalex.org/W2979185190","https://openalex.org/W2013276661","https://openalex.org/W1586726865","https://openalex.org/W3157697337","https://openalex.org/W3006133478","https://openalex.org/W4207062810","https://openalex.org/W4410277198","https://openalex.org/W4381333094","https://openalex.org/W2990233233"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2002805364","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
