{"id":"https://openalex.org/W4210580988","doi":"https://doi.org/10.1109/date.2008.4484921","title":"A Fast Approximation Algorithm for MIN-ONE SAT","display_name":"A Fast Approximation Algorithm for MIN-ONE SAT","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W4210580988","doi":"https://doi.org/10.1109/date.2008.4484921"},"language":"en","primary_location":{"id":"doi:10.1109/date.2008.4484921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2008.4484921","pdf_url":null,"source":{"id":"https://openalex.org/S4363607582","display_name":"2008 Design, Automation and Test in Europe","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Design, Automation and Test in Europe","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101624498","display_name":"Lei Fang","orcid":"https://orcid.org/0000-0001-9028-8797"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lei Fang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108516165","display_name":"Michael S. Hsiao","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael S. Hsiao","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1087","last_page":"1090"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9941999912261963,"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/T10142","display_name":"Formal Methods in Verification","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8199869394302368},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6392462253570557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6327103972434998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6248114109039307},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5964260101318359},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5393685102462769},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5297533273696899},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4195466935634613},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2397376000881195}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8199869394302368},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6392462253570557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6327103972434998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6248114109039307},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5964260101318359},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5393685102462769},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5297533273696899},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4195466935634613},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2397376000881195},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2008.4484921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2008.4484921","pdf_url":null,"source":{"id":"https://openalex.org/S4363607582","display_name":"2008 Design, Automation and Test in Europe","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Design, Automation and Test in Europe","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W99286309","https://openalex.org/W1512232178","https://openalex.org/W1605445661","https://openalex.org/W1728966390","https://openalex.org/W1951141208","https://openalex.org/W2057361103","https://openalex.org/W2116758077","https://openalex.org/W2125047455","https://openalex.org/W4243058146","https://openalex.org/W4254342428","https://openalex.org/W6604013800","https://openalex.org/W6637682689","https://openalex.org/W6683398262"],"related_works":["https://openalex.org/W2006534764","https://openalex.org/W2101101130","https://openalex.org/W2134045762","https://openalex.org/W2038529163","https://openalex.org/W2056017973","https://openalex.org/W2000356135","https://openalex.org/W1412075677","https://openalex.org/W2050201153","https://openalex.org/W2304492655","https://openalex.org/W1999154139"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,15,43],"novel":[6],"approximation":[7],"algorithm":[8],"(RelaxSAT)":[9],"for":[10],"MIN-ONE":[11,65],"SAT.":[12],"RelaxSAT":[13,51],"generates":[14],"set":[16],"of":[17,81],"constraints":[18,28],"from":[19],"the":[20,25,34,37,72],"objective":[21],"function":[22],"to":[23,32,54,78],"guide":[24],"search.":[26],"The":[27,47],"are":[29],"gradually":[30],"relaxed":[31],"eliminate":[33],"conflicts":[35],"with":[36,76],"original":[38],"Boolean":[39],"SAT":[40],"formula":[41],"until":[42],"solution":[44,73],"is":[45,52],"found.":[46],"experiments":[48],"demonstrate":[49],"that":[50],"able":[53],"handle":[55],"very":[56,68],"large":[57],"instances":[58],"which":[59],"cannot":[60],"be":[61],"solved":[62],"by":[63],"existing":[64],"algorithms;":[66],"furthermore,":[67],"tight":[69],"bounds":[70],"on":[71],"were":[74],"obtained":[75],"one":[77],"two":[79],"orders":[80],"magnitude":[82],"speedup.":[83]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}