{"id":"https://openalex.org/W1986135089","doi":"https://doi.org/10.1016/s0166-218x(00)00244-4","title":"Approximating a generalization of MAX 2SAT and MIN 2SAT","display_name":"Approximating a generalization of MAX 2SAT and MIN 2SAT","publication_year":2000,"publication_date":"2000-12-01","ids":{"openalex":"https://openalex.org/W1986135089","doi":"https://doi.org/10.1016/s0166-218x(00)00244-4","mag":"1986135089"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(00)00244-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00244-4","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Walter A. Haas School of Business, University of California, 4135 Etcheverry Hall, Berkeley, CA 94720, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Walter A. Haas School of Business, University of California, 4135 Etcheverry Hall, Berkeley, CA 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067584837","display_name":"Anu Pathria","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anu Pathria","raw_affiliation_strings":["HNC Software Inc., 5930 Cornerstone Court West, San Diego, CA 92121-3728, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HNC Software Inc., 5930 Cornerstone Court West, San Diego, CA 92121-3728, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.4092,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8086315,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"107","issue":"1-3","first_page":"41","last_page":"59"},"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.9979000091552734,"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.9979000091552734,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9898999929428101,"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/mathematics","display_name":"Mathematics","score":0.7798539400100708},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7069125175476074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6385735869407654},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6257164478302002},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4724070429801941},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46811145544052124},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.46164387464523315},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.45920661091804504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43145787715911865},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2829463481903076}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7798539400100708},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7069125175476074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6385735869407654},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6257164478302002},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4724070429801941},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46811145544052124},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.46164387464523315},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.45920661091804504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43145787715911865},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2829463481903076},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(00)00244-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00244-4","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W70664822","https://openalex.org/W90862551","https://openalex.org/W1510453926","https://openalex.org/W1985123706","https://openalex.org/W2003160050","https://openalex.org/W2011039300","https://openalex.org/W2043506441","https://openalex.org/W2044343300","https://openalex.org/W2109039359","https://openalex.org/W2996225570","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2899112296","https://openalex.org/W2569940161","https://openalex.org/W2081914349","https://openalex.org/W2100000525","https://openalex.org/W1968597711","https://openalex.org/W2110503949","https://openalex.org/W2065895258","https://openalex.org/W2003523975","https://openalex.org/W2078140591","https://openalex.org/W1986135089"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
