{"id":"https://openalex.org/W1563905845","doi":"https://doi.org/10.1007/11533719_84","title":"Complexity and Approximation of Satisfactory Partition Problems","display_name":"Complexity and Approximation of Satisfactory Partition Problems","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1563905845","doi":"https://doi.org/10.1007/11533719_84","mag":"1563905845"},"language":"en","primary_location":{"id":"doi:10.1007/11533719_84","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11533719_84","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":true,"oa_status":"green","oa_url":"https://basepub.dauphine.fr/handle/123456789/5906","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002493273","display_name":"Cristina Bazgan","orcid":"https://orcid.org/0000-0002-5460-6222"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Cristina Bazgan","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, France","Lamsade, Universit\u00e9 Paris-Dauphine, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"Lamsade, Universit\u00e9 Paris-Dauphine, France#TAB#","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026437192","display_name":"\u0179solt Tuza","orcid":"https://orcid.org/0000-0003-3235-9221"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":["Computer and Automation Institute, Hungarian Academy of Sciences, Budapest and Department of Computer Science, University of Veszpr\u00e9m, Hungary","Computer and Automation Institute, Hungarian Academy of Sciences, Budapest and Department of Computer Science, University of Veszpr\u00e9m, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, Budapest and Department of Computer Science, University of Veszpr\u00e9m, Hungary","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I140275651"]},{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, Budapest and Department of Computer Science, University of Veszpr\u00e9m, Hungary#TAB#","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I140275651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061295470","display_name":"Daniel Vanderpooten","orcid":"https://orcid.org/0000-0002-5934-0603"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Daniel Vanderpooten","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, France","Lamsade, Universit\u00e9 Paris-Dauphine, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"Lamsade, Universit\u00e9 Paris-Dauphine, France#TAB#","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002493273"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2775,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.58133333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"829","last_page":"838"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7062523365020752},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7022770643234253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5836386680603027},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.582416832447052},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5818310379981995},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5761749744415283},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5678043961524963},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5501545071601868},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4749027490615845},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.440912127494812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4382716715335846},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.41302022337913513},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4016900956630707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38030171394348145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3549008369445801},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23628348112106323}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7062523365020752},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7022770643234253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5836386680603027},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.582416832447052},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5818310379981995},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5761749744415283},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5678043961524963},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5501545071601868},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4749027490615845},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.440912127494812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4382716715335846},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.41302022337913513},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4016900956630707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38030171394348145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3549008369445801},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23628348112106323},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11533719_84","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11533719_84","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.4331","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://l1.lamsade.dauphine.fr/~bazgan/Papers/cocoon05.pdf","raw_type":"text"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/5906","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5906","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},{"id":"pmh:oai:eprints.sztaki.hu:3825","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/3825/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.fr:123456789/5906","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5906","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1584947341","https://openalex.org/W2011039300","https://openalex.org/W2039311359","https://openalex.org/W2059608229","https://openalex.org/W3161056635","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2151708648","https://openalex.org/W2358869876","https://openalex.org/W3101294957","https://openalex.org/W2795466116","https://openalex.org/W2952535410","https://openalex.org/W2792841422","https://openalex.org/W3112180171","https://openalex.org/W2377915845","https://openalex.org/W1967968533","https://openalex.org/W1563905845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}