{"id":"https://openalex.org/W7162568643","doi":"https://doi.org/10.4230/lipics.socg.2026.31","title":"Linear-Time (1+\u03b5)-Approximation Algorithms for Two-Line-Center Problems","display_name":"Linear-Time (1+\u03b5)-Approximation Algorithms for Two-Line-Center Problems","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162568643","doi":"https://doi.org/10.4230/lipics.socg.2026.31"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.31","is_oa":true,"landing_page_url":null,"pdf_url":"http://www.vldb.org/conf/2000/P089.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.vldb.org/conf/2000/P089.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075460929","display_name":"Chaeyoon Chung","orcid":"https://orcid.org/0009-0008-3363-2406"},"institutions":[{"id":"https://openalex.org/I123900574","display_name":"Pohang University of Science and Technology","ror":"https://ror.org/04xysgw12","country_code":"KR","type":"education","lineage":["https://openalex.org/I123900574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chung, Chaeyoon","raw_affiliation_strings":["Department of Computer Science and Engineering, Pohang University of Science and Technology, South Korea"],"raw_orcid":"https://orcid.org/0009-0008-3363-2406","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Pohang University of Science and Technology, South Korea","institution_ids":["https://openalex.org/I123900574"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Maheshwari, Anil","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Canada"],"raw_orcid":"https://orcid.org/0000-0002-1274-4598","affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137131459","display_name":"Michiel Smid","orcid":"https://orcid.org/0000-0003-3683-9054"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Smid, Michiel","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Canada"],"raw_orcid":"https://orcid.org/0000-0003-3683-9054","affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.48339998722076416,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.48339998722076416,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.43479999899864197,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.011599999852478504,"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/orientation","display_name":"Orientation (vector space)","score":0.6223999857902527},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5457000136375427},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5392000079154968},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.46560001373291016},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3353999853134155},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.32100000977516174},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.29809999465942383}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6360999941825867},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.6223999857902527},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5457000136375427},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5392000079154968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48910000920295715},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.46560001373291016},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4142000079154968},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32899999618530273},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3154999911785126},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.4230/lipics.socg.2026.31","is_oa":true,"landing_page_url":null,"pdf_url":"http://www.vldb.org/conf/2000/P089.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25837","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.31","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.31/LIPIcs.SoCG.2026.31.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,"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.4230/lipics.socg.2026.31","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.31","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.31","is_oa":true,"landing_page_url":null,"pdf_url":"http://www.vldb.org/conf/2000/P089.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5997947077","display_name":null,"funder_award_id":"DAAL01-96-2-0003","funder_id":"https://openalex.org/F4320338295","funder_display_name":"Army Research Laboratory"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8715236323","display_name":"CAREER:  Multimedia Analysis and Retrieval System","funder_award_id":"9734300","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320325350","display_name":"Henan Institute of Science and Technology","ror":"https://ror.org/0578f1k82"},{"id":"https://openalex.org/F4320338295","display_name":"Army Research Laboratory","ror":"https://ror.org/011hc8f90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162568643.pdf","grobid_xml":"https://content.openalex.org/works/W7162568643.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,34],"set":[2],"S":[3,27],"of":[4,68,75,84,86,95,112,135,137],"n":[5,54],"points":[6],"in":[7,26,43,71,124,152],"the":[8,12,20,38,50,73,76,82,87,93,102,118,130,133,138],"plane,":[9],"we":[10,116,143],"study":[11],"two-line-center":[13,39],"problem:":[14],"finding":[15],"two":[16,77,88,103,139],"lines":[17,78,89,97,104,140],"that":[18,41,122,150,159],"minimize":[19],"maximum":[21],"distance":[22],"from":[23],"each":[24,111],"point":[25],"to":[28,107],"its":[29],"closest":[30],"line.":[31],"We":[32,63],"present":[33],"(1+\u03b5)-approximation":[35,120],"algorithm":[36,121,149],"for":[37,129],"problem":[40],"runs":[42,123,151],"O((n/\u03b5)":[44],"log":[45,57,154],"(1/\u03b5))":[46],"time,":[47],"which":[48,72],"improves":[49],"previously":[51],"best":[52],"O(nlog":[53],"+":[55,59],"(n/\u03b5\u00b2)":[56],"(1/\u03b5)":[58],"(1/\u03b5\u00b3)log":[60],"(1/\u03b5))-time":[61],"algorithm.":[62],"also":[64,144],"consider":[65],"three":[66,114],"variants":[67],"this":[69],"problem,":[70],"orientations":[74,94],"are":[79,98,105],"restricted:":[80],"(1)":[81],"orientation":[83,134],"one":[85,136],"is":[90,141,161],"fixed,":[91,99,142],"(2)":[92],"both":[96],"and":[100,157],"(3)":[101],"required":[106],"be":[108],"parallel.":[109],"For":[110],"these":[113],"variants,":[115],"give":[117,145],"first":[119],"linear":[125],"time.":[126],"In":[127],"particular,":[128],"variant":[131],"where":[132],"an":[146],"improved":[147],"exact":[148],"O(n":[153],"n)":[155],"time":[156],"show":[158],"it":[160],"optimal.":[162]},"counts_by_year":[],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2026-05-28T00:00:00"}