{"id":"https://openalex.org/W6888010500","doi":"https://doi.org/10.18419/opus-10217","title":"Algorithm engineering in geometric network planning and data mining","display_name":"Algorithm engineering in geometric network planning and data mining","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W6888010500","doi":"https://doi.org/10.18419/opus-10217"},"language":"en","primary_location":{"id":"pmh:oai:elib.uni-stuttgart.de:11682/10234","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","pdf_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","source":{"id":"https://openalex.org/S4306401556","display_name":"OPUS Publication Server of the University of Stuttgart (University of Stuttgart)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I100066346","host_organization_name":"University of Stuttgart","host_organization_lineage":["https://openalex.org/I100066346"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoralThesis"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Seybold, Martin P.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Seybold, Martin P.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6136000156402588},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5117999911308289},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4855000078678131},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4855000078678131},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4772999882698059},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.460999995470047},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.4438000023365021},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4284999966621399},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.3986999988555908},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.3874000012874603},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3612000048160553}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6136000156402588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.542900025844574},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4968999922275543},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4560000002384186},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.4438000023365021},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3986999988555908},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36480000615119934},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3612000048160553},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3463999927043915},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.33410000801086426},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.29409998655319214},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.2540999948978424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25279998779296875},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2460000067949295},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.2442999929189682},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24289999902248383},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.23409999907016754},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.23409999907016754},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.23260000348091125},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.22869999706745148},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.2168000042438507},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.21490000188350677},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.21490000188350677}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:elib.uni-stuttgart.de:11682/10234","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","pdf_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","source":{"id":"https://openalex.org/S4306401556","display_name":"OPUS Publication Server of the University of Stuttgart (University of Stuttgart)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I100066346","host_organization_name":"University of Stuttgart","host_organization_lineage":["https://openalex.org/I100066346"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoralThesis"},{"id":"doi:10.18419/opus-10217","is_oa":true,"landing_page_url":"https://doi.org/10.18419/opus-10217","pdf_url":null,"source":{"id":"https://openalex.org/S7407052998","display_name":"Universit\u00e4tsbibliothek Stuttgart","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:elib.uni-stuttgart.de:11682/10234","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","pdf_url":"http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-102344","source":{"id":"https://openalex.org/S4306401556","display_name":"OPUS Publication Server of the University of Stuttgart (University of Stuttgart)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I100066346","host_organization_name":"University of Stuttgart","host_organization_lineage":["https://openalex.org/I100066346"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6888010500.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,82,94,175,328,527],"geometric":[1,27,303],"nature":[2],"of":[3,10,26,62,65,85,245,260,270,276,296,301,311,315,420,511,545,551],"computational":[4],"problems":[5,22],"provides":[6,321],"a":[7,52,59,78,137,151,181,185,205,261,267,293,309,316,322,368,377,440,506,524],"rich":[8],"source":[9],"solution":[11],"strategies":[12],"as":[13,15,231,235,332],"well":[14,200],"complicating":[16],"obstacles.":[17],"This":[18,264],"thesis":[19],"considers":[20],"three":[21],"in":[23,50,67,75,129,159,201,283,355,418,437,452,496,548],"the":[24,39,123,154,160,172,224,236,246,257,284,299,302,326,341,386,431,445,493,543,549],"context":[25,550],"network":[28,56],"planning,":[29],"data":[30,348,387,423,553],"mining":[31],"and":[32,106,280,352,357,363,466,477,498,540,558],"spherical":[33,480],"geometry.":[34],"Geometric":[35,286],"Network":[36,44],"Planning:":[37],"In":[38,113],"d-dimensional":[40],"Generalized":[41],"Minimum":[42],"Manhattan":[43,80],"problem":[45,88,124,173,189,227,262,329],"(d-GMMN)":[46],"one":[47],"is":[48,73,89,99,150,178,228,306,371,399,462],"interested":[49,451],"finding":[51],"minimum":[53],"cost":[54],"rectilinear":[55],"N":[57,76],"connecting":[58],"given":[60,294,517],"set":[61],"n":[63,255],"pairs":[64],"points":[66],"\u211d^d":[68,438],"such":[69],"that":[70,157,223,243,266,409,461,484],"each":[71,358],"pair":[72],"connected":[74],"via":[77],"shortest":[79],"path.":[81],"decision":[83],"version":[84],"this":[86,114],"optimization":[87],"known":[90,96],"to":[91,215,233,307,385,492,504],"be":[92,213],"NP-hard.":[93],"best":[95],"upper":[97],"bound":[98],"an":[100,107,142,454],"O(log^{d+1}":[101],"n)":[102,109,165],"approximation":[103,110,144,208],"for":[104,111,146,153,272,289,325,412,459,515,533],"d>2":[105],"O(log":[108,164],"2-GMMN.":[112,147],"work":[115],"we":[116,192,241,392,501],"provide":[117,478,489],"some":[118],"more":[119,186,401],"insight":[120],"in,":[121],"whether":[122],"admits":[125],"constant":[126],"factor":[127],"approximations":[128,476],"polynomial":[130],"time.":[131],"We":[132,221,375,449,470,482],"develop":[133],"two":[134],"new":[135],"algorithms,":[136],"`scale-diversity":[138],"aware'":[139],"algorithm":[140,177,248],"with":[141,203,217,509],"O(D)":[143],"guarantee":[145],"Here":[148],"D":[149,162],"measure":[152],"different":[155,278],"`scales'":[156],"appear":[158],"input,":[161],"\u2208":[163,457,519],"but":[166],"potentially":[167],"much":[168],"smaller,":[169],"depending":[170],"on":[171,180,430,444,464,474,523],"instance.":[174,263],"other":[176],"based":[179],"primal-dual":[182,247],"scheme":[183],"solving":[184],"general,":[187],"combinatorial":[188],"-":[190],"which":[191,320,382],"call":[193,393],"Path":[194,225],"Cover.":[195],"On":[196],"2-GMMN":[197,273],"it":[198,211,410],"performs":[199],"practice":[202],"good":[204],"posteriori,":[206],"instance-based":[207],"guarantees.":[209],"Furthermore,":[210],"can":[212,487],"extended":[214],"deal":[216],"obstacle":[218],"avoiding":[219],"requirements.":[220],"show":[222,242,408,502],"Cover":[226],"at":[229,512],"least":[230],"hard":[232],"approximate":[234],"Hitting":[237],"Set":[238],"problem.":[239],"Moreover,":[240],"solutions":[244,491],"are":[249,450],"4\u03c9^2":[250],"approximations,":[251],"where":[252],"\u03c9":[253],"\u2264":[254],"denotes":[256],"maximum":[258],"overlap":[259,282],"implies":[265],"potential":[268],"proof":[269],"O(1)-inapproximability":[271],"requires":[274],"gadgets":[275],"many":[277],"scales":[279],"non-constant":[281],"construction.":[285],"Map":[287],"Matching":[288],"Heterogeneous":[290],"Data:":[291],"For":[292],"sequence":[295,310],"location":[297],"measurements,":[298],"goal":[300],"map":[304,379,415],"matching":[305,380],"compute":[308],"movements":[312],"along":[313],"edges":[314],"spatially":[317],"embedded":[318],"graph":[319],"`good":[323,369],"explanation'":[324,370],"measurements.":[327],"gets":[330],"challenging":[331],"real":[333],"world":[334],"data,":[335],"like":[336],"traces":[337],"or":[338],"graphs":[339],"from":[340,531],"OpenStreetMap":[342],"project,":[343],"does":[344],"not":[345],"exhibit":[346],"homogeneous":[347],"quality.":[349],"Graph":[350],"details":[351],"errors":[353],"vary":[354],"areas":[356],"trace":[359],"has":[360,467],"changing":[361],"noise":[362],"precision.":[364],"Hence,":[365],"formalizing":[366],"what":[367,391],"becomes":[372],"quite":[373],"difficult.":[374],"propose":[376],"novel":[378],"approach,":[381],"locally":[383],"adapts":[384],"quality":[388,414,424],"by":[389,556],"constructing":[390],"dominance":[394],"decompositions.":[395],"While":[396],"our":[397,406,546],"approach":[398,547],"computationally":[400],"expensive":[402],"than":[403],"previous":[404,525],"approaches,":[405],"experiments":[407,541],"allows":[411],"high":[413],"matching,":[416],"even":[417],"presence":[419],"highly":[421],"variable":[422],"without":[425],"parameter":[426],"tuning.":[427],"Rational":[428],"Points":[429],"Unit":[432],"Spheres:":[433],"Each":[434],"non-zero":[435],"point":[436,442,508],"identifies":[439],"closest":[441],"x":[443],"unit":[446],"sphere":[447,494],"S^{d-1}.":[448],"computing":[453],"\u03b5-approximation":[455],"y":[456],"\u211a^d":[458],"x,":[460],"exactly":[463],"S^{d-1}":[465],"low":[468],"bit-size.":[469],"revise":[471],"lower":[472],"bounds":[473],"rational":[475,507],"explicit":[479],"instances.":[481],"prove":[483],"floating-point":[485],"numbers":[486],"only":[488],"trivial":[490],"equation":[495],"\u211d^2":[497],"\u211d^3.":[499],"However,":[500],"how":[503],"construct":[505],"denominators":[510],"most":[513],"10(d-1)/\u03b5^2":[514],"any":[516],"\u03b5":[518],"(0,":[520],"1/8],":[521],"improving":[522],"result.":[526],"method":[528],"further":[529],"benefits":[530],"algorithms":[532],"simultaneous":[534],"Diophantine":[535],"approximation.":[536],"Our":[537],"open-source":[538],"implementation":[539],"demonstrate":[542],"practicality":[544],"massive":[552],"sets,":[554],"geo-referenced":[555],"latitude":[557],"longitude":[559],"values.":[560]},"counts_by_year":[],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}