{"id":"https://openalex.org/W1518985150","doi":"https://doi.org/10.1007/3-540-44849-7_21","title":"Approximation Hardness for Small Occurrence Instances of NP-Hard Problems","display_name":"Approximation Hardness for Small Occurrence Instances of NP-Hard Problems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1518985150","doi":"https://doi.org/10.1007/3-540-44849-7_21","mag":"1518985150"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44849-7_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44849-7_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/presentation/Approximation_hardness_for_small_occurrence_instances_of_NP-hard_problems/23343554","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022095494","display_name":"Miroslav Chleb\u00edk","orcid":"https://orcid.org/0000-0001-8137-479X"},"institutions":[{"id":"https://openalex.org/I4210091327","display_name":"Max Planck Institute for Mathematics in the Sciences","ror":"https://ror.org/00ez2he07","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210091327"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Miroslav Chleb\u00edk","raw_affiliation_strings":["MPI for Mathematics in the Sciences, D-04103, Leipzig"],"affiliations":[{"raw_affiliation_string":"MPI for Mathematics in the Sciences, D-04103, Leipzig","institution_ids":["https://openalex.org/I4210091327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061610147","display_name":"Janka Chleb\u0131\u0301kov\u00e1","orcid":"https://orcid.org/0000-0002-9493-2049"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Janka Chleb\u00edkov\u00e1","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, CAU, D-24098, Kiel"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, CAU, D-24098, Kiel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022095494"],"corresponding_institution_ids":["https://openalex.org/I4210091327"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.6004,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.94399502,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"152","last_page":"164"},"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.9998999834060669,"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.9998999834060669,"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.9988999962806702,"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.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6437342166900635},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6304109692573547},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6271710395812988},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6080014109611511},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5852189660072327},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5274244546890259},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4382704794406891},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4266957640647888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42022061347961426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40409380197525024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37252819538116455},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.31729984283447266},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05290740728378296}],"concepts":[{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6437342166900635},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6304109692573547},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6271710395812988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6080014109611511},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5852189660072327},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5274244546890259},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4382704794406891},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4266957640647888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42022061347961426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40409380197525024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37252819538116455},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31729984283447266},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05290740728378296},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/3-540-44849-7_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44849-7_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.5481","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.5481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-kiel.de/inf/Jansen/Publications03/dm_ecc.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.1498","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.1498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-kiel.de/inf/Jansen/Publications03/dm_ciac_final.ps.gz","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:121577","is_oa":false,"landing_page_url":"http://edoc.mpg.de/121577","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and complexity, 152-164 (2003)","raw_type":"InBook"},{"id":"pmh:oai:figshare.com:article/23343554","is_oa":true,"landing_page_url":"https://figshare.com/articles/presentation/Approximation_hardness_for_small_occurrence_instances_of_NP-hard_problems/23343554","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:researchportal.port.ac.uk:publications/fe0d8e3c-740b-4b84-9962-4a0b05cc6f6b","is_oa":false,"landing_page_url":"https://researchportal.port.ac.uk/portal/en/publications/approximation-hardness-for-small-occurrence-instances-of-nphard-problems(fe0d8e3c-740b-4b84-9962-4a0b05cc6f6b).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401774","display_name":"Portsmouth Research Portal (University of Portsmouth)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63072094","host_organization_name":"University of Portsmouth","host_organization_lineage":["https://openalex.org/I63072094"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/23343554","is_oa":true,"landing_page_url":"https://figshare.com/articles/presentation/Approximation_hardness_for_small_occurrence_instances_of_NP-hard_problems/23343554","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W1488051549","https://openalex.org/W1518985150","https://openalex.org/W1519520700","https://openalex.org/W1521148214","https://openalex.org/W1527607312","https://openalex.org/W1536142435","https://openalex.org/W1999032440","https://openalex.org/W2029777782","https://openalex.org/W2038225707","https://openalex.org/W2071016718","https://openalex.org/W2076386251","https://openalex.org/W2140118062","https://openalex.org/W3166880264","https://openalex.org/W4240487979"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W2962917430","https://openalex.org/W1561811279","https://openalex.org/W4299801389","https://openalex.org/W2028468530","https://openalex.org/W3000738495","https://openalex.org/W2574604093","https://openalex.org/W1584635930","https://openalex.org/W2377915845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}