{"id":"https://openalex.org/W1995472412","doi":"https://doi.org/10.1137/080729256","title":"Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut","display_name":"Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1995472412","doi":"https://doi.org/10.1137/080729256","mag":"1995472412"},"language":"en","primary_location":{"id":"doi:10.1137/080729256","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080729256","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/210860","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085876663","display_name":"Christoph Amb\u00fchl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christoph Amb\u00fchl","raw_affiliation_strings":["christoph@csc.liv.ac.uk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"christoph@csc.liv.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053978143","display_name":"Monaldo Mastrolilli","orcid":"https://orcid.org/0000-0002-2948-9749"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monaldo Mastrolilli","raw_affiliation_strings":["monaldo@idsia.ch#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"monaldo@idsia.ch#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["osven@kth.se#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"osven@kth.se#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.2531,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.98543066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"40","issue":"2","first_page":"567","last_page":"596"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9987000226974487,"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.9984999895095825,"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/mathematics","display_name":"Mathematics","score":0.7567237615585327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7547967433929443},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5909391641616821},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5720400214195251},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5301445722579956},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5185502171516418},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5031747221946716},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.48610734939575195},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4719861149787903},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46577757596969604},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4398227632045746},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4193948209285736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1334964632987976}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7567237615585327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7547967433929443},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5909391641616821},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5720400214195251},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5301445722579956},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5185502171516418},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5031747221946716},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.48610734939575195},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4719861149787903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46577757596969604},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4398227632045746},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4193948209285736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1334964632987976},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/080729256","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080729256","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.5948","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.5948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://algo.epfl.ch/~osven/Ola Svensson_publications/SICOMP11a.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:210860","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/210860","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.tind.io:210860","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/117443","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:210860","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/210860","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1571037334","https://openalex.org/W1573558634","https://openalex.org/W1965562201","https://openalex.org/W1989720410","https://openalex.org/W2001020288","https://openalex.org/W2007525305","https://openalex.org/W2011039300","https://openalex.org/W2019404063","https://openalex.org/W2019578639","https://openalex.org/W2053651631","https://openalex.org/W2079966248","https://openalex.org/W2091602684","https://openalex.org/W2109291623","https://openalex.org/W2110906177","https://openalex.org/W2148352980","https://openalex.org/W2150148016","https://openalex.org/W2150718242","https://openalex.org/W2157316274","https://openalex.org/W2161719898","https://openalex.org/W3137884736"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W1561811279","https://openalex.org/W1606488336","https://openalex.org/W3125240838","https://openalex.org/W2377915845"],"abstract_inverted_index":{"We":[0,29],"consider":[1],"the":[2,8,53,60],"Minimum":[3],"Linear":[4],"Arrangement":[5],"problem":[6],"and":[7],"(Uniform)":[9],"Sparsest":[10],"Cut":[11],"problem.":[12],"So":[13],"far,":[14],"these":[15],"two":[16],"notorious":[17],"NP-hard":[18],"graph":[19],"problems":[20,41],"have":[21,33],"resisted":[22],"all":[23],"attempts":[24],"to":[25,73],"prove":[26],"inapproximability":[27],"results.":[28],"show":[30,51],"that":[31,52],"they":[32],"no":[34],"polynomial":[35],"time":[36],"approximation":[37],"scheme,":[38],"unless":[39],"NP-complete":[40],"can":[42,56],"be":[43,57],"solved":[44],"in":[45],"randomized":[46],"subexponential":[47],"time.":[48],"Furthermore,":[49],"we":[50,67],"same":[54],"techniques":[55],"used":[58],"for":[59,65],"Maximum":[61],"Edge":[62],"Biclique":[63],"problem,":[64],"which":[66],"obtain":[68],"a":[69,78],"hardness":[70],"factor":[71],"similar":[72],"previous":[74],"results":[75],"but":[76],"under":[77],"more":[79],"standard":[80],"assumption.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}