{"id":"https://openalex.org/W2016001296","doi":"https://doi.org/10.1007/s00224-005-1140-7","title":"Approximating MIN 2-SAT and MIN 3-SAT","display_name":"Approximating MIN 2-SAT and MIN 3-SAT","publication_year":2005,"publication_date":"2005-04-14","ids":{"openalex":"https://openalex.org/W2016001296","doi":"https://doi.org/10.1007/s00224-005-1140-7","mag":"2016001296"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-005-1140-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-005-1140-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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/A5091391628","display_name":"Adi Avidor","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Adi Avidor","raw_affiliation_strings":["School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel","School of Computer Science, Tel Aviv University, Tel\u00a0Aviv 69978, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Tel\u00a0Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Uri Zwick","raw_affiliation_strings":["School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel","School of Computer Science, Tel Aviv University, Tel\u00a0Aviv 69978, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Tel\u00a0Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005525211","https://openalex.org/A5091391628"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":1.2807,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.80506314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"3","first_page":"329","last_page":"345"},"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.9991000294685364,"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.9991000294685364,"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.9962999820709229,"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.9955999851226807,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.8180167078971863},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6381587982177734},{"id":"https://openalex.org/keywords/minimax-approximation-algorithm","display_name":"Minimax approximation algorithm","score":0.548345685005188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46644067764282227},{"id":"https://openalex.org/keywords/spouges-approximation","display_name":"Spouge's approximation","score":0.4544908404350281},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4425572156906128},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.42532455921173096},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.423493891954422},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4004649519920349},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3803340792655945},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27673715353012085},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.11133822798728943},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10228145122528076}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8180167078971863},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6381587982177734},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.548345685005188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46644067764282227},{"id":"https://openalex.org/C62376455","wikidata":"https://www.wikidata.org/wiki/Q935210","display_name":"Spouge's approximation","level":3,"score":0.4544908404350281},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4425572156906128},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.42532455921173096},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.423493891954422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4004649519920349},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3803340792655945},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27673715353012085},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.11133822798728943},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10228145122528076}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-005-1140-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-005-1140-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W1491901203","https://openalex.org/W1527607312","https://openalex.org/W1567267630","https://openalex.org/W1572977974","https://openalex.org/W1576805635","https://openalex.org/W1985123706","https://openalex.org/W1986135089","https://openalex.org/W1987579904","https://openalex.org/W1999032440","https://openalex.org/W2028146521","https://openalex.org/W2029163643","https://openalex.org/W2030702117","https://openalex.org/W2036285035","https://openalex.org/W2041605864","https://openalex.org/W2043506441","https://openalex.org/W2053079614","https://openalex.org/W2064600658","https://openalex.org/W2074844420","https://openalex.org/W2077783414","https://openalex.org/W2088188524","https://openalex.org/W2105543801","https://openalex.org/W2109039359","https://openalex.org/W2111385661","https://openalex.org/W2137373403","https://openalex.org/W2146489710"],"related_works":["https://openalex.org/W2737349826","https://openalex.org/W2595727203","https://openalex.org/W2596940265","https://openalex.org/W1813603268","https://openalex.org/W1913954093","https://openalex.org/W189995875","https://openalex.org/W158010619","https://openalex.org/W2538730123","https://openalex.org/W2016001296","https://openalex.org/W2885465588"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}