{"id":"https://openalex.org/W2023056082","doi":"https://doi.org/10.1007/s00453-001-0012-z","title":"Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems","display_name":"Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2023056082","doi":"https://doi.org/10.1007/s00453-001-0012-z","mag":"2023056082"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0012-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0012-z","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/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":true,"raw_author_name":"M. Karpinski","raw_affiliation_strings":["Department of Computer Science, University of Bonn, 53117 Bonn, Germany. marek@cs.uni-bonn.de., DE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, 53117 Bonn, Germany. marek@cs.uni-bonn.de., DE","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108090276"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14983278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"3","first_page":"386","last_page":"397"},"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.9993000030517578,"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.9993000030517578,"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.9977999925613403,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9912999868392944,"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/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5684406161308289},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5572168827056885},{"id":"https://openalex.org/keywords/l-reduction","display_name":"L-reduction","score":0.5456451177597046},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5425640940666199},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5348016023635864},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5223621129989624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4953140318393707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48517924547195435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34179553389549255},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28541299700737},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.14805644750595093},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.04373502731323242}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5684406161308289},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5572168827056885},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.5456451177597046},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5425640940666199},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5348016023635864},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5223621129989624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4953140318393707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48517924547195435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34179553389549255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28541299700737},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.14805644750595093},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.04373502731323242}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-001-0012-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0012-z","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.16.3807","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/~marek/publications/PoTime-Algo.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.7175","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.7175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/~marek/publications/85172-cs.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.845","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.informatik.uni-trier.de/pub/Users-CTVD/eccc/reports/1997/TR97-024/Paper.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.2978","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.2978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.icsi.berkeley.edu/pub/techreports/1997/tr-97-022.ps.gz","raw_type":"text"},{"id":"mag:2023056082","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc4.html#ECCC-TR97-024","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1996543069","https://openalex.org/W83468612","https://openalex.org/W2034715615","https://openalex.org/W2186817708","https://openalex.org/W2078744297","https://openalex.org/W2029830880","https://openalex.org/W3193976176","https://openalex.org/W2781807987","https://openalex.org/W1603421148","https://openalex.org/W1984121220","https://openalex.org/W2576440460","https://openalex.org/W3123600527","https://openalex.org/W2768943331","https://openalex.org/W3003859616","https://openalex.org/W13622202","https://openalex.org/W2385221347","https://openalex.org/W2558534874","https://openalex.org/W3005066064","https://openalex.org/W2110131298","https://openalex.org/W2524771967"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}