{"id":"https://openalex.org/W2151489238","doi":"https://doi.org/10.1145/1376616.1376621","title":"Capacity constrained assignment in spatial databases","display_name":"Capacity constrained assignment in spatial databases","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2151489238","doi":"https://doi.org/10.1145/1376616.1376621","mag":"2151489238"},"language":"en","primary_location":{"id":"doi:10.1145/1376616.1376621","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ink.library.smu.edu.sg/sis_research/412","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035706700","display_name":"Leong Hou U","orcid":"https://orcid.org/0000-0002-5135-5165"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Leong Hou U","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017431281","display_name":"Man Lung Yiu","orcid":"https://orcid.org/0000-0002-9619-4924"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Man Lung Yiu","raw_affiliation_strings":["Aalborg University, Aalborg, Denmark"],"affiliations":[{"raw_affiliation_string":"Aalborg University, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053720072","display_name":"Kyriakos Mouratidis","orcid":"https://orcid.org/0000-0002-8835-430X"},"institutions":[{"id":"https://openalex.org/I79891267","display_name":"Singapore Management University","ror":"https://ror.org/050qmg959","country_code":"SG","type":"education","lineage":["https://openalex.org/I79891267"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kyriakos Mouratidis","raw_affiliation_strings":["Singapore Management University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Singapore Management University, Singapore, Singapore","institution_ids":["https://openalex.org/I79891267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045731304","display_name":"Nikos Mamoulis","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Nikos Mamoulis","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035706700"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":3.8122,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.93720565,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"15","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.98089998960495,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9807999730110168,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7052805423736572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.591137170791626},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5551552176475525},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5228184461593628},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.51543128490448},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.506484866142273},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4935511350631714},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4711519479751587},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.461834192276001},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.45680564641952515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4369085133075714},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4328274130821228},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.42251673340797424},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.412320077419281},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.4114112854003906},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37893053889274597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.341999351978302},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3273965120315552},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.19588053226470947},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12838095426559448}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7052805423736572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.591137170791626},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5551552176475525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5228184461593628},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.51543128490448},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.506484866142273},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4935511350631714},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4711519479751587},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.461834192276001},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.45680564641952515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4369085133075714},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4328274130821228},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.42251673340797424},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.412320077419281},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.4114112854003906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37893053889274597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.341999351978302},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3273965120315552},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.19588053226470947},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12838095426559448},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1376616.1376621","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:ink.library.smu.edu.sg:sis_research-1411","is_oa":true,"landing_page_url":"https://ink.library.smu.edu.sg/sis_research/412","pdf_url":null,"source":{"id":"https://openalex.org/S4377196871","display_name":"Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79891267","host_organization_name":"Singapore Management University","host_organization_lineage":["https://openalex.org/I79891267"],"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":"http://dx.doi.org/10.1145/1376616.1376621","raw_type":"Conference Proceeding Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.4718","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.4718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mysmu.edu/faculty/kyriakos/SIGMOD08-CCA.pdf","raw_type":"text"},{"id":"pmh:oai:hub.hku.hk:10722/151934","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/151934","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference_Paper"},{"id":"pmh:oai:pure.atira.dk:publications/9454fb10-d5bf-11dd-a016-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/9454fb10-d5bf-11dd-a016-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"U, L H, Yiu, M L, Mouratidis, K & Mamoulis, N 2008, Capacity constrained assignment in spatial databases. in Proceedings of the 2008 ACM SIGMOD international conference on Management of data. Association for Computing Machinery (ACM), pp. 15-28, ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, Canada, 10/06/2008. https://doi.org/10.1145/1376616.1376621","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:ink.library.smu.edu.sg:sis_research-1411","is_oa":true,"landing_page_url":"https://ink.library.smu.edu.sg/sis_research/412","pdf_url":null,"source":{"id":"https://openalex.org/S4377196871","display_name":"Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79891267","host_organization_name":"Singapore Management University","host_organization_lineage":["https://openalex.org/I79891267"],"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":"http://dx.doi.org/10.1145/1376616.1376621","raw_type":"Conference Proceeding Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1512840853","https://openalex.org/W1564381193","https://openalex.org/W1977545325","https://openalex.org/W1981020230","https://openalex.org/W1990111898","https://openalex.org/W2059378307","https://openalex.org/W2116135393","https://openalex.org/W2118269922","https://openalex.org/W2125708920","https://openalex.org/W2131620262","https://openalex.org/W2137845302","https://openalex.org/W2141461755","https://openalex.org/W2151135734","https://openalex.org/W2151700547","https://openalex.org/W2154648702","https://openalex.org/W3148765228","https://openalex.org/W4206499008","https://openalex.org/W4287631832","https://openalex.org/W6679274366","https://openalex.org/W6682630424","https://openalex.org/W6992951189","https://openalex.org/W7027717352"],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W2162831161","https://openalex.org/W4297623464","https://openalex.org/W4240054244","https://openalex.org/W2242006561","https://openalex.org/W2962992394","https://openalex.org/W4221140790","https://openalex.org/W3188033804","https://openalex.org/W4367050013","https://openalex.org/W2074675257"],"abstract_inverted_index":{"Given":[0],"a":[1,11,28,37,118,202],"point":[2,12,48],"set":[3,13],"P":[4,43],"of":[5,15,68,87,112,189,224],"customers":[6],"(e.g.,":[7,18],"WiFi":[8],"receivers)":[9],"and":[10,78,145,157,207,222],"Q":[14,26,41,51,144],"service":[16,114],"providers":[17],"wireless":[19],"access":[20],"points),":[21],"where":[22],"each":[23,47],"q":[24,49],"\u2208":[25,50,53],"has":[27],"capacity":[29,32],"q.k,":[30],"the":[31,66,80,85,96,102,105,110,138,186,190,220,225],"constrained":[33],"assignment":[34,82,103,178],"(CCA)":[35],"is":[36,70,93,99,123,153],"matching":[38],"M":[39,69],"\u2286":[40],"\u00d7":[42],"such":[44],"that":[45,179,200],"(i)":[46],"(p":[52],"P)":[54],"appears":[55],"at":[56],"most":[57,61],"k":[58],"times":[59],"(at":[60],"once)":[62],"in":[63,117,165],"M,":[64],"(ii)":[65],"size":[67],"maximized":[71],"(i.e.,":[72,84,196],"it":[73,158],"comprises":[74],"min{|P|,":[75],"\u2211q\u2208Qq.k}":[76],"pairs),":[77],"(iii)":[79],"total":[81],"cost":[83],"sum":[86],"Euclidean":[88],"distances":[89],"within":[90],"all":[91],"pairs)":[92],"minimized.":[94],"Thus,":[95],"CCA":[97,198],"problem":[98],"to":[100,115,125,133,155,163],"identify":[101],"with":[104],"optimal":[106,177],"overall":[107],"quality;":[108],"intuitively,":[109],"quality":[111,213],"q's":[113],"p":[116],"given":[119],"(q,":[120],"p)":[121],"pair":[122],"anti-proportional":[124],"their":[126],"distance.":[127],"Although":[128],"max-flow":[129],"algorithms":[130,175],"are":[131],"applicable":[132],"this":[134,151,170],"problem,":[135],"they":[136],"require":[137],"complete":[139],"distance-based":[140],"bipartite":[141],"graph":[142,152],"between":[143,204],"P.":[146],"For":[147],"large":[148,162],"spatial":[149,187],"datasets,":[150],"expensive":[154],"compute":[156],"may":[159],"be":[160],"too":[161],"fit":[164],"main":[166],"memory.":[167],"Motivated":[168],"by":[169,211],"fact,":[171],"we":[172,193],"propose":[173],"efficient":[174],"for":[176],"employ":[180],"novel":[181],"edge-pruning":[182],"strategies,":[183],"based":[184],"on":[185],"properties":[188],"problem.":[191],"Additionally,":[192],"develop":[194],"approximate":[195],"suboptimal)":[197],"solutions":[199],"provide":[201],"trade-off":[203],"result":[205],"accuracy":[206],"computation":[208],"cost,":[209],"abiding":[210],"theoretical":[212],"guarantees.":[214],"A":[215],"thorough":[216],"experimental":[217],"evaluation":[218],"demonstrates":[219],"efficiency":[221],"practicality":[223],"proposed":[226],"techniques.":[227]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}