{"id":"https://openalex.org/W1593375062","doi":"https://doi.org/10.4086/toc.2015.v011a010","title":"","display_name":"","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1593375062","doi":"https://doi.org/10.4086/toc.2015.v011a010","mag":"1593375062"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2015.v011a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2015.v011a010","pdf_url":"http://www.theoryofcomputing.org/articles/v011a010/v011a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v011a010/v011a010.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Per Austrin","raw_affiliation_strings":["KTH\u00a0\u2013 Royal Institute of Technology"],"affiliations":[{"raw_affiliation_string":"KTH\u00a0\u2013 Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008657432","display_name":"Rajsekar Manokaran","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Rajsekar Manokaran","raw_affiliation_strings":["KTH\u00a0\u2013 Royal Institute of Technology"],"affiliations":[{"raw_affiliation_string":"KTH\u00a0\u2013 Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089148248","display_name":"Cenny Wenner","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Cenny Wenner","raw_affiliation_strings":["KTH\u00a0\u2013 Royal Institute of Technology"],"affiliations":[{"raw_affiliation_string":"KTH\u00a0\u2013 Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055776088"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":1.0915,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78466993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"257","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9991000294685364,"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.9980999827384949,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7123548984527588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6998022794723511},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.654065728187561},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5967879891395569},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.5871751308441162},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4650057256221771},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4202349781990051},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4143449664115906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4035834074020386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.139974445104599}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7123548984527588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6998022794723511},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.654065728187561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5967879891395569},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.5871751308441162},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4650057256221771},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4202349781990051},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4143449664115906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4035834074020386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.139974445104599},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4086/toc.2015.v011a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2015.v011a010","pdf_url":"http://www.theoryofcomputing.org/articles/v011a010/v011a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:su-107683","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-107683","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"}],"best_oa_location":{"id":"doi:10.4086/toc.2015.v011a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2015.v011a010","pdf_url":"http://www.theoryofcomputing.org/articles/v011a010/v011a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5801337121","display_name":null,"funder_award_id":"621-2012-4546","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1593375062.pdf","grobid_xml":"https://content.openalex.org/works/W1593375062.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1489461653","https://openalex.org/W1505165912","https://openalex.org/W1586488998","https://openalex.org/W1970259241","https://openalex.org/W1973898585","https://openalex.org/W1990896327","https://openalex.org/W1992068214","https://openalex.org/W1999032440","https://openalex.org/W2010471713","https://openalex.org/W2011039300","https://openalex.org/W2019578639","https://openalex.org/W2028932986","https://openalex.org/W2055711302","https://openalex.org/W2056590617","https://openalex.org/W2091921997","https://openalex.org/W2097823813","https://openalex.org/W2103649698","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2132605415","https://openalex.org/W2140971199","https://openalex.org/W2146489710","https://openalex.org/W2148352980","https://openalex.org/W2163430289","https://openalex.org/W2163925208","https://openalex.org/W2166793106","https://openalex.org/W2167975570","https://openalex.org/W2179897858","https://openalex.org/W3023311638","https://openalex.org/W3037538996","https://openalex.org/W4244547255","https://openalex.org/W4250613930","https://openalex.org/W4300471124"],"related_works":["https://openalex.org/W2728054344","https://openalex.org/W2284958355","https://openalex.org/W2950077880","https://openalex.org/W4301487118","https://openalex.org/W2023722467","https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2952838392"],"abstract_inverted_index":{"We":[0,62],"show":[1,63],"improved":[2],"NP-hardness":[3],"of":[4,27,84,92],"approximating":[5],"Ordering-Constraint":[6],"Satisfaction":[7],"Problems":[8],"(OCSPs).":[9],"For":[10],"the":[11,54,65,89],"two":[12],"most":[13],"well-studied":[14],"OCSPs,":[15],"MAXIMUM":[16,20,66],"ACYCLIC":[17],"SUBGRAPH":[18],"and":[19,30,72],"BETWEENNESS,":[21],"we":[22],"prove":[23],"NP-hard":[24],"approximation":[25,60,70],"factors":[26],"14/15":[28],"+":[29,32],"1/2":[31],",":[33],"respectively.":[34],"When":[35],"it":[36],"is":[37,56,69],"hard":[38],"to":[39,58,97],"approximate":[40],"an":[41],"OCSP":[42,55],"by":[43],"a":[44,49,81],"constant":[45],"better":[46],"than":[47],"taking":[48],"uniform":[50],"random":[51],"ordering,":[52],"then":[53],"said":[57],"be":[59],"resistant.":[61],"that":[64,73],"Non-BETWEENNESS":[67],"PROBLEM":[68],"resistant":[71],"there":[74],"are":[75],"width-m":[76],"approximation-resistant":[77,93],"OCSPs":[78,94],"accepting":[79],"only":[80,96],"fraction":[82],"1/(m/2)!":[83],"assignments.":[85],"These":[86],"results":[87],"provide":[88],"first":[90],"examples":[91],"subject":[95],"P":[98],"=":[99],"NP.":[100]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}