{"id":"https://openalex.org/W7118288021","doi":"https://doi.org/10.1137/1.9781611978964.28","title":"Tree Violation Distance under Constraints","display_name":"Tree Violation Distance under Constraints","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118288021","doi":"https://doi.org/10.1137/1.9781611978964.28"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978964.28","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.28","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"},"type":"conference-paper","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/A5122149289","display_name":"Debarati Das","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debarati Das","raw_affiliation_strings":["Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014402783","display_name":"Evangelos Kipouridis","orcid":"https://orcid.org/0000-0002-5830-5830"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Evangelos Kipouridis","raw_affiliation_strings":["Max Planck Institute for Informatics & Saarland Informatics Campus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics & Saarland Informatics Campus","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052812610","display_name":"Joachim Spoerhase","orcid":"https://orcid.org/0000-0002-2601-6452"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Joachim Spoerhase","raw_affiliation_strings":["University of Liverpool"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Liverpool","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07067241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.20110000669956207,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.20110000669956207,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.10660000145435333,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.07970000058412552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6269000172615051},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.616599977016449},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.48969998955726624},{"id":"https://openalex.org/keywords/distance-matrix","display_name":"Distance matrix","score":0.48840001225471497},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4327999949455261},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3407000005245209}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6809999942779541},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6269000172615051},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.616599977016449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5536999702453613},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.48969998955726624},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3813000023365021},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3407000005245209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3249000012874603},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3084000051021576},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3070000112056732},{"id":"https://openalex.org/C5349765","wikidata":"https://www.wikidata.org/wiki/Q5282866","display_name":"Distance matrices in phylogeny","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.257999986410141}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611978964.28","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.28","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"},{"id":"pmh:oai:pure.mpg.de:item_3717564","is_oa":false,"landing_page_url":"https://hdl.handle.net/21.11116/0000-0013-4132-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Simplicity of Algorithms","raw_type":"info:eu-repo/semantics/conferenceObject"}],"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":[],"abstract_inverted_index":{"We":[0],"consider":[1],"numerical":[2],"taxonomy":[3],"problems,":[4,33],"where":[5],"we":[6,61],"are":[7,86],"given":[8],"an":[9],"\\(n":[10],"\\times":[11],"n\\)":[12],"distance":[13,39,48],"matrix":[14,40],"\\(D\\)":[15],"and":[16,42,54,75,102],"the":[17,22,34,47,50,70],"goal":[18],"is":[19,107],"to":[20,26],"compute":[21],"closest":[23],"tree":[24,51,71],"metric":[25],"\\(D\\).":[27],"In":[28],"constrained":[29,81],"versions":[30,82],"of":[31,83],"these":[32,84],"input":[35],"also":[36],"contains":[37],"a":[38],"\\(L\\),":[41],"for":[43,89,95],"every":[44],"pair":[45],"\\(uv\\)":[46],"in":[49],"between":[52],"\\(u\\)":[53],"\\(v\\)":[55],"should":[56],"be":[57],"at":[58],"least":[59],"\\(L(uv)\\);":[60],"say":[62],"that":[63,80],"\\(L\\)":[64],"describes":[65],"lower":[66,103],"bound":[67,104],"constraints":[68,105],"on":[69],"distances.":[72],"Farach,":[73],"Kannan,":[74],"Warnow":[76],"[STOC":[77],"1993]":[78],"suggested":[79],"problems":[85],"especially":[87],"relevant":[88],"applications.":[90],"Surprisingly,":[91],"one":[92],"cannot":[93],"hope":[94],"much":[96],"better,":[97],"as":[98],"handling":[99],"both":[100],"upper":[101],"simultaneously":[106],"intractable.":[108]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-08T00:00:00"}