{"id":"https://openalex.org/W2180209872","doi":"https://doi.org/10.1007/s00453-012-9646-2","title":"PASS Approximation: A Framework for Analyzing and Designing Heuristics","display_name":"PASS Approximation: A Framework for Analyzing and Designing Heuristics","publication_year":2012,"publication_date":"2012-04-18","ids":{"openalex":"https://openalex.org/W2180209872","doi":"https://doi.org/10.1007/s00453-012-9646-2","mag":"2180209872"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9646-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9646-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uriel Feige","raw_affiliation_strings":["Weizmann Institute, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009111822","display_name":"Nicole Immorlica","orcid":"https://orcid.org/0000-0003-4180-4657"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicole Immorlica","raw_affiliation_strings":["Northwestern University, Chicago, IL, USA","Northwestern University, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Chicago, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Northwestern University, Chicago, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075598023","display_name":"Vahab Mirrokni","orcid":"https://orcid.org/0000-0001-6705-5629"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vahab S. Mirrokni","raw_affiliation_strings":["Google Research, New York, NY, USA","Google Research, New York, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Research, New York, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102876085","display_name":"Hamid Nazerzadeh","orcid":"https://orcid.org/0000-0002-2601-7826"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hamid Nazerzadeh","raw_affiliation_strings":["University of Southern California, Los Angeles, CA, USA","University of Southern California, Los Angeles, USA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"University of Southern California, Los Angeles, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102876085"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.3845,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.82807983,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"66","issue":"2","first_page":"450","last_page":"478"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7991147041320801},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7286819219589233},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7099094390869141},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6941328048706055},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6697532534599304},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6626875400543213},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6090778112411499},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6046177744865417},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5860831141471863},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5457077622413635},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5410749316215515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49419811367988586},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.458278626203537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4519686996936798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41631779074668884},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.28643837571144104}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7991147041320801},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7286819219589233},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7099094390869141},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6941328048706055},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6697532534599304},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6626875400543213},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6090778112411499},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6046177744865417},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5860831141471863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5457077622413635},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5410749316215515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49419811367988586},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.458278626203537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4519686996936798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41631779074668884},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28643837571144104},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-012-9646-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9646-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.9731","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.9731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~feige/mypapers/pass.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.9520","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.9520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.northwestern.edu/~nickle/pubs/passJournal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.2322","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.2322","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.northwestern.edu/~nickle/pubs/pass.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.9541","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.9541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/people/hamidnz/pass_approximation.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.7538","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.7538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-bcf.usc.edu/%7Enazerzad/pdf/pass_approximation.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1501644705","https://openalex.org/W1803694112","https://openalex.org/W1973315504","https://openalex.org/W1987178221","https://openalex.org/W1995275762","https://openalex.org/W1998735557","https://openalex.org/W2003827431","https://openalex.org/W2026820987","https://openalex.org/W2034053794","https://openalex.org/W2061820396","https://openalex.org/W2081192873","https://openalex.org/W2081254453","https://openalex.org/W2088272899","https://openalex.org/W2100440346","https://openalex.org/W2118962121","https://openalex.org/W2126307323","https://openalex.org/W2134331592","https://openalex.org/W2141403143","https://openalex.org/W2143996311","https://openalex.org/W2157316274","https://openalex.org/W2175796269","https://openalex.org/W2293218619","https://openalex.org/W2610183793","https://openalex.org/W2913890173","https://openalex.org/W3141561286"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W3100114454","https://openalex.org/W2561769964","https://openalex.org/W276709744","https://openalex.org/W2507810539","https://openalex.org/W1978117135","https://openalex.org/W2157424698","https://openalex.org/W1991979416","https://openalex.org/W2035016254","https://openalex.org/W2949353123"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}