link.springer.com/article/10.1007/s11280-013-0223-7
Preview meta tags from the link.springer.com website.
Linked Hostnames
21- 36 links tolink.springer.com
- 12 links toscholar.google.com
- 10 links towww.springernature.com
- 8 links todoi.org
- 6 links toscholar.google.co.uk
- 6 links towww.ncbi.nlm.nih.gov
- 2 links tocitation-needed.springer.com
- 2 links tosupport.springernature.com
Thumbnail
Search Engine Appearance
https://link.springer.com/article/10.1007/s11280-013-0223-7
The min-dist location selection and facility replacement queries - World Wide Web
We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing fac
Bing
The min-dist location selection and facility replacement queries - World Wide Web
https://link.springer.com/article/10.1007/s11280-013-0223-7
We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing fac
DuckDuckGo
The min-dist location selection and facility replacement queries - World Wide Web
We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing fac
General Meta Tags
117- titleThe min-dist location selection and facility replacement queries | World Wide Web
- charsetUTF-8
- X-UA-CompatibleIE=edge
- applicable-devicepc,mobile
- viewportwidth=device-width, initial-scale=1
Open Graph Meta Tags
6- og:urlhttps://link.springer.com/article/10.1007/s11280-013-0223-7
- og:typearticle
- og:site_nameSpringerLink
- og:titleThe min-dist location selection and facility replacement queries - World Wide Web
- og:descriptionWe propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing facilities, we select a location from a given set of potential locations for establishing a new facility, so that the average distance between a client and her nearest facility is minimized. The problem has a wide range of applications in urban development simulation, massively multiplayer online games, and decision support systems. We also investigate a variant of the problem, where we consider replacing (instead of adding) a facility while achieving the same optimization goal. We call this variant the min-dist facility replacement problem. We explore two common approaches to location optimization problems and present methods based on those approaches for solving the min-dist location selection problem. However, those methods either need to maintain an extra index or fall short in efficiency. To address their drawbacks, we propose a novel method (named MND), which has very close performance to the fastest method but does not need an extra index. We then utilize the key idea behind MND to approach the min-dist facility replacement problem, which results in two algorithms names MSND and RID. We provide a detailed comparative cost analysis and conduct extensive experiments on the various algorithms. The results show that MND and RID outperform their competitors by orders of magnitude.
Twitter Meta Tags
6- twitter:site@SpringerLink
- twitter:cardsummary_large_image
- twitter:image:altContent cover image
- twitter:titleThe min-dist location selection and facility replacement queries
- twitter:descriptionWorld Wide Web - We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing facilities, we select a...
Item Prop Meta Tags
3- position1
- position2
- position3
Link Tags
9- apple-touch-icon/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
- canonicalhttps://link.springer.com/article/10.1007/s11280-013-0223-7
- icon/oscar-static/img/favicons/darwin/android-chrome-192x192.png
- icon/oscar-static/img/favicons/darwin/favicon-32x32.png
- icon/oscar-static/img/favicons/darwin/favicon-16x16.png
Emails
1Links
95- http://scholar.google.com/scholar_lookup?&title=A%20highly%20optimized%20algorithm%20for%20continuous%20intersection%20join%20queries%20over%20moving%20objects&journal=VLDB%20J.&doi=10.1007%2Fs00778-011-0259-1&volume=21&pages=561-586&publication_year=2012&author=Zhang%2CR&author=Qi%2CJ&author=Lin%2CD&author=Wang%2CW&author=Wong%2CRCW
- http://scholar.google.com/scholar_lookup?&title=Analysis%20and%20evaluation%20of%20v%2A-knn%3A%20an%20efficient%20algorithm%20for%20moving%20knn%20queries&journal=VLDB%20J.&doi=10.1007%2Fs00778-009-0163-0&volume=19&issue=3&pages=307-332&publication_year=2010&author=Nutanong%2CS&author=Zhang%2CR&author=Tanin%2CE&author=Kulik%2CL
- http://scholar.google.com/scholar_lookup?&title=Design%20of%20a%20web-based%20lbs%20framework%20addressing%20usability%2C%20cost%2C%20and%20implementation%20constraints&journal=World%20Wide%20Web&doi=10.1007%2Fs11280-010-0090-4&volume=13&pages=391-418&publication_year=2010&author=Delfos%2CJ&author=Tan%2CT&author=Veenendaal%2CB
- http://scholar.google.com/scholar_lookup?&title=Discovery%20of%20convoys%20in%20trajectory%20databases&journal=Proc.%20VLDB%20Endow.&doi=10.14778%2F1453856.1453971&volume=1&issue=1&pages=1068-1080&publication_year=2008&author=Jeung%2CH&author=Yiu%2CML&author=Zhou%2CX&author=Jensen%2CCS&author=Shen%2CHT
- http://scholar.google.com/scholar_lookup?&title=Efficient%20method%20for%20maximizing%20bichromatic%20reverse%20nearest%20neighbor&journal=Proc.%20VLDB%20Endow.&doi=10.14778%2F1687627.1687754&volume=2&pages=1126-1137&publication_year=2009&author=Wong%2CRCW&author=%C3%96zsu%2CMT&author=Yu%2CPS&author=Fu%2CAWC&author=Liu%2CL