{"id":"https://openalex.org/W1966923282","doi":"https://doi.org/10.1007/s00037-006-0205-6","title":"On the complexity of approximating k-set packing","display_name":"On the complexity of approximating k-set packing","publication_year":2006,"publication_date":"2006-04-25","ids":{"openalex":"https://openalex.org/W1966923282","doi":"https://doi.org/10.1007/s00037-006-0205-6","mag":"1966923282"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-006-0205-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-006-0205-6","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5024431603","display_name":"Elad Hazan","orcid":"https://orcid.org/0000-0002-1566-3216"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Elad Hazan","raw_affiliation_strings":["Computer Science Department, Princeton University, Princeton, NJ, 08540, U.S.A","[Computer Science Department, Princeton University, Princeton, NJ]"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Princeton University, Princeton, NJ, 08540, U.S.A","institution_ids":[]},{"raw_affiliation_string":"[Computer Science Department, Princeton University, Princeton, NJ]","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007318528","display_name":"Muli Safra","orcid":"https://orcid.org/0000-0002-5022-7727"},"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":false,"raw_author_name":"Shmuel Safra","raw_affiliation_strings":["School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel","School of Computer Science Tel Aviv University Tel Aviv Israel"],"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 Aviv Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010957839","display_name":"Oded Schwartz","orcid":"https://orcid.org/0000-0003-1309-5566"},"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":false,"raw_author_name":"Oded Schwartz","raw_affiliation_strings":["School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel","School of Computer Science Tel Aviv University Tel Aviv Israel"],"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 Aviv Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024431603"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":8.0894,"has_fulltext":false,"cited_by_count":191,"citation_normalized_percentile":{"value":0.97966491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"15","issue":"1","first_page":"20","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/hypergraph","display_name":"Hypergraph","score":0.8820568323135376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7762609124183655},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7703331708908081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.721701443195343},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6845493316650391},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6731727719306946},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5938889980316162},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5419905781745911},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4642321467399597},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.44848594069480896},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.44700199365615845},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43513721227645874},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4278133809566498},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3248435854911804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1866607964038849},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12320283055305481},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10547593235969543}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8820568323135376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7762609124183655},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7703331708908081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.721701443195343},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6845493316650391},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6731727719306946},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5938889980316162},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5419905781745911},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4642321467399597},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.44848594069480896},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.44700199365615845},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43513721227645874},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4278133809566498},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3248435854911804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1866607964038849},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12320283055305481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10547593235969543},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00037-006-0205-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-006-0205-6","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.5754","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.5754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~odedsc/papers/k-Set-Packing.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.9549","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.9549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~ehazan/papers/kdm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.918","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~odedsc/papers/k-SP-journal.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W20058877","https://openalex.org/W42852446","https://openalex.org/W162897487","https://openalex.org/W1494735819","https://openalex.org/W1501644705","https://openalex.org/W1530685949","https://openalex.org/W1576128767","https://openalex.org/W1966805076","https://openalex.org/W1970259241","https://openalex.org/W1975442866","https://openalex.org/W1982506822","https://openalex.org/W1990326132","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2019578639","https://openalex.org/W2035532007","https://openalex.org/W2055656009","https://openalex.org/W2059608229","https://openalex.org/W2071016718","https://openalex.org/W2081254453","https://openalex.org/W2086653003","https://openalex.org/W2089247135","https://openalex.org/W2140118062","https://openalex.org/W2148352980","https://openalex.org/W2486528299","https://openalex.org/W3161056635","https://openalex.org/W3166880264"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W4299801389","https://openalex.org/W2131810278","https://openalex.org/W2574604093","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W1496354680","https://openalex.org/W2963411648","https://openalex.org/W2952838392","https://openalex.org/W2377915845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}