{"id":"https://openalex.org/W7110430990","doi":"https://doi.org/10.4230/lipics.esa.2025.12","title":"Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better","display_name":"Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110430990","doi":"https://doi.org/10.4230/lipics.esa.2025.12"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.17381","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.17381","pdf_url":"https://arxiv.org/pdf/2504.17381","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"parent_works":[{"id":"https://openalex.org/W7084419693","display_name":"LIPIcs, Volume 351, ESA 2025, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W7110430990","https://openalex.org/W7084419693"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.17381","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007972675","display_name":"Jacobus Conradi","orcid":"https://orcid.org/0000-0002-8259-1187","observed_orcids":["https://orcid.org/0000-0002-8259-1187"]},"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":"Conradi, Jacobus","raw_affiliation_strings":["University of Bonn, Germany"],"raw_orcid":"https://orcid.org/0000-0002-8259-1187","affiliations":[{"raw_affiliation_string":"University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017692588","display_name":"Anne Driemel","orcid":"https://orcid.org/0000-0002-1943-2589","observed_orcids":["https://orcid.org/0000-0002-1943-2589"]},"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":"Driemel, Anne","raw_affiliation_strings":["University of Bonn, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1943-2589","affiliations":[{"raw_affiliation_string":"University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6758000254631042,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6758000254631042,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.2660999894142151,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.03709999844431877,"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/coverage-optimization","display_name":"coverage optimization","score":0.9200000166893005},{"id":"https://openalex.org/keywords/frechet-distance","display_name":"Fr\u00e9chet distance","score":0.875},{"id":"https://openalex.org/keywords/polygonal-curves","display_name":"polygonal curves","score":0.9039999842643738},{"id":"https://openalex.org/keywords/trajectory-data","display_name":"trajectory data","score":0.7440000176429749},{"id":"https://openalex.org/keywords/set-cover","display_name":"set cover","score":0.7360000014305115},{"id":"https://openalex.org/keywords/bicriteria-approximation","display_name":"bicriteria approximation","score":0.8980000019073486},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.7559999823570251},{"id":"https://openalex.org/keywords/cubic-time-algorithm","display_name":"cubic time algorithm","score":0.6349999904632568},{"id":"https://openalex.org/keywords/metric-balls","display_name":"metric balls","score":0.6119999885559082},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.4090000092983246}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6416000127792358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6355999708175659},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5644999742507935},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5579000115394592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5468000173568726},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5069000124931335},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4950999915599823},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45750001072883606},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45570001006126404},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44929999113082886},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4106999933719635},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34779998660087585},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2815999984741211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2775999903678894},{"id":"https://openalex.org/C184389593","wikidata":"https://www.wikidata.org/wiki/Q603159","display_name":"Curve fitting","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2504.17381","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.17381","pdf_url":"https://arxiv.org/pdf/2504.17381","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:24480","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.12/LIPIcs.ESA.2025.12.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2504.17381","doi":"https://doi.org/10.48550/arxiv.2504.17381","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.17381","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.esa.2025.12","doi":"https://doi.org/10.4230/lipics.esa.2025.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2025.12","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.17381","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.17381","pdf_url":"https://arxiv.org/pdf/2504.17381","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1048014841","display_name":"FOR 2535: Anticipating Human Behavior","funder_award_id":"313421352","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110430990.pdf","grobid_xml":"https://content.openalex.org/works/W7110430990.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1978545031","https://openalex.org/W2004899468","https://openalex.org/W2052333181","https://openalex.org/W2116264435","https://openalex.org/W2124299914","https://openalex.org/W2157734830","https://openalex.org/W2163322487","https://openalex.org/W2500139799","https://openalex.org/W2770369581","https://openalex.org/W2777475024","https://openalex.org/W2794402674","https://openalex.org/W2798667295","https://openalex.org/W2990600932","https://openalex.org/W3090906250","https://openalex.org/W3097266870","https://openalex.org/W3137732947","https://openalex.org/W3208481011","https://openalex.org/W4224273744","https://openalex.org/W4386302102","https://openalex.org/W4391223162","https://openalex.org/W4392118326","https://openalex.org/W6936344596"],"related_works":["https://openalex.org/W4224273744","https://openalex.org/W3195613367","https://openalex.org/W3134212605","https://openalex.org/W6929569514","https://openalex.org/W4386302102","https://openalex.org/W4392118326","https://openalex.org/W7116038994","https://openalex.org/W7019145995","https://openalex.org/W6948174188","https://openalex.org/W4412222195"],"abstract_inverted_index":{"Many":[0],"application":[1],"areas":[2],"collect":[3],"unstructured":[4],"trajectory":[5],"data.":[6],"In":[7,42,90],"subtrajectory":[8,155],"clustering,":[9],"one":[10],"is":[11,48,114,128,140,147,151,162,171,193,254,293],"interested":[12],"to":[13,115,169,257,267],"find":[14],"patterns":[15],"in":[16,283],"this":[17,32,181],"data":[18],"using":[19,247],"a":[20,81,87,97,117,154,163,184,203,214,224,255,271],"hybrid":[21],"combination":[22,83],"of":[23,31,69,73,80,84,101,120,129,153,157,187,196,220,226,238,274],"segmentation":[24],"and":[25,39,107,111,134,217,277,288],"clustering.":[26],"We":[27,175],"analyze":[28],"two":[29],"variants":[30,44],"problem":[33,182,231],"based":[34],"on":[35,64,138,145],"the":[36,45,54,66,70,74,91,112,194,209,218,221,235,239,258,290],"well-known":[37],"\\textsc{SetCover}":[38],"\\textsc{CoverageMaximization}":[40],"problems.":[41],"both":[43,284],"set":[46,119],"system":[47],"induced":[49],"by":[50,78,213,223],"metric":[51],"balls":[52],"under":[53],"Fr\u00e9chet":[55,167,210],"distance":[56,104,168,211],"centered":[57],"at":[58,131,172],"polygonal":[59,98],"curves.":[60],"Our":[61],"algorithms":[62,285],"focus":[63],"improving":[65],"running":[67,185,272,291],"time":[68,186,273,292],"update":[71],"step":[72],"generic":[75],"greedy":[76],"algorithm":[77,179,201,269],"means":[79],"careful":[82],"sweeps":[85],"through":[86],"candidate":[88],"space.":[89],"first":[92],"variant,":[93],"we":[94,261],"are":[95],"given":[96],"curve":[99,127,241],"$P$":[100,139,146,158,242],"complexity":[102,108,130],"$n$,":[103],"threshold":[105,212],"$\u0394$":[106],"bound":[109],"$\\ell$":[110,133],"goal":[113],"identify":[116],"minimum-size":[118],"center":[121,126,164,249],"curves":[122],"$\\mathcal{C}$,":[123],"where":[124,191,251],"each":[125],"most":[132,173],"every":[135],"point":[136,143],"$p$":[137,144],"covered.":[141],"A":[142],"covered":[148,246],"if":[149,297],"it":[150],"part":[152],"$\u03c0_p$":[156,170],"such":[159],"that":[160,207,243,263,282],"there":[161],"$c\\in\\mathcal{C}$":[165],"whose":[166],"$\u0394$.":[174],"present":[176],"an":[177,197,268],"approximation":[178,205,279],"for":[180,234],"with":[183,270],"$O((n^2\\ell":[188],"+":[189],"\\sqrt{k_\u0394}n^{5/2})\\log^2n)$,":[190],"$k_\u0394$":[192],"size":[195,219],"optimal":[198],"solution.":[199],"The":[200,229],"gives":[202],"bicriterial":[204],"guarantee":[206],"relaxes":[208],"constant":[215],"factor":[216,225],"solution":[222],"$O(\\log":[227],"n)$.":[228],"second":[230],"variant":[232],"asks":[233],"maximum":[236],"fraction":[237],"input":[240],"can":[244],"be":[245],"$k$":[248],"curves,":[250],"$k\\leq":[252],"n$":[253],"parameter":[256],"algorithm.":[259],"Here,":[260],"show":[262],"our":[264],"techniques":[265],"lead":[266],"$O((k+\\ell)n^2\\log^2":[275],"n)$":[276],"similar":[278],"guarantees.":[280],"Note":[281],"$k,k_\u0394\\in":[286],"O(n)$":[287],"hence":[289],"cubic,":[294],"or":[295],"better":[296],"$k\\ll":[298],"n$.":[299]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-12-08T00:00:00"}
