{"id":"https://openalex.org/W1527607312","doi":"https://doi.org/10.1007/3-540-48523-6_17","title":"On Some Tighter Inapproximability Results (Extended Abstract)","display_name":"On Some Tighter Inapproximability Results (Extended Abstract)","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1527607312","doi":"https://doi.org/10.1007/3-540-48523-6_17","mag":"1527607312"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48523-6_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48523-6_17","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":"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/A5023910624","display_name":"Piotr Berman","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Piotr Berman","raw_affiliation_strings":["Dept. of Computer Science, Pennsylvania State University, USA","Pennsylvania State Univ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Pennsylvania State Univ#TAB#","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["Dept. of Computer Science, University of Bonn, Bonn, USA","University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Bonn, USA","institution_ids":[]},{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":51.5873,"has_fulltext":false,"cited_by_count":204,"citation_normalized_percentile":{"value":0.99845917,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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.9916999936103821,"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/bounded-function","display_name":"Bounded function","score":0.7651855945587158},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.660811185836792},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5929769277572632},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5040956735610962},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4963424801826477},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4900437593460083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4889775514602661},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4767340421676636},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43016767501831055},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4205881953239441},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4045361876487732},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3627866506576538},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21096038818359375},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0806487500667572}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7651855945587158},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.660811185836792},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5929769277572632},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5040956735610962},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4963424801826477},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4900437593460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4889775514602661},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4767340421676636},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43016767501831055},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4205881953239441},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4045361876487732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3627866506576538},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21096038818359375},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0806487500667572},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-48523-6_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48523-6_17","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W1505154685","https://openalex.org/W1510730180","https://openalex.org/W1591000087","https://openalex.org/W1595252626","https://openalex.org/W1973518576","https://openalex.org/W1980844319","https://openalex.org/W1990326132","https://openalex.org/W2028353615","https://openalex.org/W2038225707","https://openalex.org/W2053651631","https://openalex.org/W2055656009","https://openalex.org/W2067425328","https://openalex.org/W2070449673","https://openalex.org/W2080905757","https://openalex.org/W2081254453","https://openalex.org/W2087226760","https://openalex.org/W2102813451","https://openalex.org/W2109039359","https://openalex.org/W2125347105","https://openalex.org/W2143391442","https://openalex.org/W2157622572","https://openalex.org/W2402203281","https://openalex.org/W2917997019","https://openalex.org/W3166880264","https://openalex.org/W4210731599","https://openalex.org/W6604831629","https://openalex.org/W6611731895"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2094388041","https://openalex.org/W3102280101","https://openalex.org/W2538178083","https://openalex.org/W159504299","https://openalex.org/W1968988491"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":13}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
