{"id":"https://openalex.org/W2127492079","doi":"https://doi.org/10.1016/0020-0190(92)90226-l","title":"On the equal-subset-sum problem","display_name":"On the equal-subset-sum problem","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W2127492079","doi":"https://doi.org/10.1016/0020-0190(92)90226-l","mag":"2127492079"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(92)90226-l","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90226-l","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,"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"},"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/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Institut f\u00fcr Grundlagen der Informationsverarbeitung, Technische Universit\u00e4t Graz, Klosterwiesgasse 32, A-8010 Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Grundlagen der Informationsverarbeitung, Technische Universit\u00e4t Graz, Klosterwiesgasse 32, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008792169","display_name":"Zhongliang Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Zhongliang Yu","raw_affiliation_strings":["Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010 Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Kopernikusgasse 24, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080746477"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.25203155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"42","issue":"6","first_page":"299","last_page":"302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.998199999332428,"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/disjoint-sets","display_name":"Disjoint sets","score":0.793590784072876},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.7792842984199524},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7241267561912537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6789982914924622},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5503326654434204},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5319502949714661},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4974367916584015},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.47858572006225586},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.47170138359069824},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.31893762946128845},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2936263978481293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22476673126220703},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.19303682446479797},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07270675897598267}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.793590784072876},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.7792842984199524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7241267561912537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6789982914924622},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5503326654434204},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5319502949714661},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4974367916584015},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.47858572006225586},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.47170138359069824},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31893762946128845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2936263978481293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22476673126220703},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.19303682446479797},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07270675897598267},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0020-0190(92)90226-l","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90226-l","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,"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"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/8691cd3c-c4ea-4549-a03c-33bbe80ffdd1","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/8691cd3c-c4ea-4549-a03c-33bbe80ffdd1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Woeginger, G J & Yu, Z 1992, 'On the equal-subset-sum problem', Information Processing Letters, vol. 42, no. 6, pp. 299-302. https://doi.org/10.1016/0020-0190(92)90226-L","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.643.7807","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.7807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~jcheriya/PDF_files/fcuts.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:680515","is_oa":false,"landing_page_url":"http://repository.tue.nl/680515","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0020-0190","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/8691cd3c-c4ea-4549-a03c-33bbe80ffdd1","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/8691cd3c-c4ea-4549-a03c-33bbe80ffdd1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Information Processing Letters, 42(6), 299 - 302. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1493733990","https://openalex.org/W2011039300","https://openalex.org/W6629456099"],"related_works":["https://openalex.org/W2152478214","https://openalex.org/W1497071043","https://openalex.org/W2963699585","https://openalex.org/W4297725065","https://openalex.org/W2046202598","https://openalex.org/W1969466213","https://openalex.org/W2123106609","https://openalex.org/W1977563107","https://openalex.org/W2127492079","https://openalex.org/W1598605111"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}