{"id":"https://openalex.org/W2053308793","doi":"https://doi.org/10.1016/s0020-0190(98)00021-0","title":"Better approximation algorithms for Set Splitting and Not-All-Equal Sat","display_name":"Better approximation algorithms for Set Splitting and Not-All-Equal Sat","publication_year":1998,"publication_date":"1998-03-01","ids":{"openalex":"https://openalex.org/W2053308793","doi":"https://doi.org/10.1016/s0020-0190(98)00021-0","mag":"2053308793"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(98)00021-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(98)00021-0","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/A5102881576","display_name":"Gunnar Andersson","orcid":"https://orcid.org/0000-0001-8060-7491"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Gunnar Andersson","raw_affiliation_strings":["Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden","Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029419425","display_name":"Lars Engebretsen","orcid":"https://orcid.org/0000-0003-2294-921X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Lars Engebretsen","raw_affiliation_strings":["Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden","Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029419425"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":3.8971,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.93924352,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"65","issue":"6","first_page":"305","last_page":"311"},"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.9994999766349792,"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.9994999766349792,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.733170211315155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7321544289588928},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6090996265411377},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.49181702733039856},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4704277515411377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4443283677101135},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4275967478752136},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42158347368240356},{"id":"https://openalex.org/keywords/linear-approximation","display_name":"Linear approximation","score":0.41181156039237976},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.0945291817188263}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.733170211315155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7321544289588928},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6090996265411377},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.49181702733039856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4704277515411377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4443283677101135},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4275967478752136},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42158347368240356},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.41181156039237976},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0945291817188263},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(98)00021-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(98)00021-0","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W239232176","https://openalex.org/W1525063915","https://openalex.org/W1564025554","https://openalex.org/W1985123706","https://openalex.org/W2004660767","https://openalex.org/W2026634792","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2087226760","https://openalex.org/W2109039359","https://openalex.org/W2917997019","https://openalex.org/W3161056635","https://openalex.org/W6609145003","https://openalex.org/W6631445809","https://openalex.org/W6670750863"],"related_works":["https://openalex.org/W3122413977","https://openalex.org/W2017216075","https://openalex.org/W96441109","https://openalex.org/W2023374895","https://openalex.org/W143765064","https://openalex.org/W2885465588","https://openalex.org/W4391069889","https://openalex.org/W189995875","https://openalex.org/W2963656294","https://openalex.org/W2163172376"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}