{"id":"https://openalex.org/W4388775762","doi":"https://doi.org/10.1137/20m1316500","title":"Approximation Algorithms for LCS and LIS with Truly Improved Running Times","display_name":"Approximation Algorithms for LCS and LIS with Truly Improved Running Times","publication_year":2023,"publication_date":"2023-11-17","ids":{"openalex":"https://openalex.org/W4388775762","doi":"https://doi.org/10.1137/20m1316500"},"language":"en","primary_location":{"id":"doi:10.1137/20m1316500","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1316500","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035432679","display_name":"Aviad Rubinstein","orcid":"https://orcid.org/0000-0002-6900-8612"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aviad Rubinstein","raw_affiliation_strings":["Computer Science, Stanford University, Stanford, CA 94305 USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, Stanford University, Stanford, CA 94305 USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087093711","display_name":"Saeed Seddighin","orcid":"https://orcid.org/0000-0002-3951-7096"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saeed Seddighin","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago, IL 60637 USA"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, IL 60637 USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103280080","display_name":"Zhao Song","orcid":"https://orcid.org/0000-0003-4589-5234"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhao Song","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ 08540 USA"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ 08540 USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101033892","display_name":"Xiaorui Sun","orcid":"https://orcid.org/0009-0003-8914-2514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaorui Sun","raw_affiliation_strings":["University of Illinois, Chicago, IL 60637 USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Chicago, IL 60637 USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035432679"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3497,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66684005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"54","issue":"4","first_page":"FOCS19","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9890999794006348,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9007971882820129},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7806063294410706},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6392837762832642},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6378359198570251},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5453311204910278},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5234748125076294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4926164746284485},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4735155403614044},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.47077012062072754},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.42652687430381775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39931195974349976},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35840898752212524},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.2608720660209656}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9007971882820129},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7806063294410706},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6392837762832642},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6378359198570251},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5453311204910278},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5234748125076294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4926164746284485},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4735155403614044},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47077012062072754},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.42652687430381775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39931195974349976},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35840898752212524},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.2608720660209656},{"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/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1316500","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1316500","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.699999988079071,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W104148001","https://openalex.org/W1444168583","https://openalex.org/W1528180898","https://openalex.org/W1586809440","https://openalex.org/W1974708980","https://openalex.org/W2012010763","https://openalex.org/W2042587503","https://openalex.org/W2043856632","https://openalex.org/W2069893028","https://openalex.org/W2097860339","https://openalex.org/W3002517191","https://openalex.org/W3023302315","https://openalex.org/W3093792486","https://openalex.org/W3098862080","https://openalex.org/W3141776272","https://openalex.org/W4233413206","https://openalex.org/W4235936977","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2333286882","https://openalex.org/W1746697883","https://openalex.org/W1999395788","https://openalex.org/W3022573534","https://openalex.org/W2577457156","https://openalex.org/W2019844103","https://openalex.org/W1950413524","https://openalex.org/W2027506564","https://openalex.org/W1585640088","https://openalex.org/W2971374205"],"abstract_inverted_index":{"Longest":[0],"common":[1],"subsequence":[2,55],"(LCS)":[3],"is":[4,49],"a":[5,16,121,132],"classic":[6],"and":[7,79,106,113,131,158,174,183],"central":[8],"problem":[9,26,57],"in":[10,30,46,62,75,81],"combinatorial":[11],"optimization.":[12],"While":[13],"LCS":[14,38,74,112,127,212],"admits":[15],"quadratic":[17],"time":[18,78,124,135],"solution,":[19],"recent":[20],"evidence":[21],"suggests":[22],"that":[23],"solving":[24],"the":[25,52,90,93,98,108,163,188,214,217],"may":[27],"be":[28,60],"impossible":[29],"truly":[31,76,82,122,133],"subquadratic":[32,77,123],"time.":[33,64,84],"A":[34],"special":[35],"case":[36],"of":[37,92,119,162,187,195,216],"wherein":[39],"each":[40],"character":[41],"appears":[42],"at":[43],"most":[44],"once":[45],"every":[47],"string":[48],"equivalent":[50],"to":[51,97,201,220],"longest":[53],"increasing":[54],"(LIS)":[56],"which":[58],"can":[59],"solved":[61],"quasilinear":[63],"In":[65],"this":[66,103],"work,":[67],"we":[68],"present":[69,202],"novel":[70],"algorithms":[71,205],"for":[72,111,126,137,206,211],"approximating":[73],"LIS":[80,114,138],"sublinear":[83,134],"Our":[85,209],"approximation":[86,129,140,204],"factors":[87],"depend":[88],"on":[89,168,193],"ratio":[91,104],"optimal":[94],"solution":[95],"size":[96],"input":[99],"size.":[100],"We":[101],"denote":[102],"by":[105,149],"obtain":[107],"following":[109],"results":[110],"without":[115],"any":[116],"prior":[117],"knowledge":[118],":":[120],"algorithm":[125,136],"with":[128,139],"factor":[130,141],".":[142],"The":[143],"triangle":[144,218],"inequality":[145,219],"was":[146],"recently":[147],"used":[148],"M.":[150,154,156,181,184],"Boroujeni,":[151],"S.":[152,159],"Ehsani,":[153],"Ghodsi,":[155],"HajiAghayi,":[157],"Seddingham":[160],"[Proceedings":[161,186],"29th":[164],"Annual":[165,190],"ACM-SIAM":[166],"Symposium":[167,192],"Discrete":[169],"Algorithms,":[170],"2018,":[171,198],"pp.":[172,199],"1170\u20131189]":[173],"D.":[175,177],"Chakraborty,":[176],"Das,":[178],"E.":[179],"Goldenberg,":[180],"Koucky,":[182],"Saks":[185],"59th":[189],"IEEE":[191],"Foundations":[194],"Computer":[196],"Science,":[197],"979\u2013990]":[200],"new":[203],"edit":[207],"distance.":[208],"techniques":[210],"extend":[213],"notion":[215],"nonmetric":[221],"settings.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}