Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287672570> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W4287672570 abstract "Consider an online facility assignment problem where a set of facilities $F = { f_1, f_2, f_3, cdots, f_{|F|} }$ of equal capacity $l$ is situated on a metric space and customers arrive one by one in an online manner on that space. We assign a customer $c_i$ to a facility $f_j$ before a new customer $c_{i+1}$ arrives. The cost of this assignment is the distance between $c_i$ and $f_j$. The objective of this problem is to minimize the sum of all assignment costs. Recently Ahmed et al. (TCS, 806, pp. 455-467, 2020) studied the problem where the facilities are situated on a line and computed competitive ratio of Algorithm Greedy which assigns the customer to the nearest available facility. They computed competitive ratio of algorithm named Algorithm Optimal-Fill which assigns the new customer considering optimal assignment of all previous customers. They also studied the problem where the facilities are situated on a connected unweighted graph. In this paper we first consider that $F$ is situated on the vertices of a connected unweighted grid graph $G$ of size $r times c$ and customers arrive one by one having positions on the vertices of $G$. We show that Algorithm Greedy has competitive ratio $r times c + r + c$ and Algorithm Optimal-Fill has competitive ratio $O(r times c)$. We later show that the competitive ratio of Algorithm Optimal-Fill is $2|F|$ for any arbitrary graph. Our bound is tight and better than the previous result. We also consider the facilities are distributed arbitrarily on a plane and provide an algorithm for the scenario. We also provide an algorithm that has competitive ratio $(2n-1)$. Finally, we consider a straight line metric space and show that no algorithm for the online facility assignment problem has competitive ratio less than $9.001$." @default.
- W4287672570 created "2022-07-25" @default.
- W4287672570 creator A5001115259 @default.
- W4287672570 creator A5054894469 @default.
- W4287672570 creator A5061722991 @default.
- W4287672570 date "2020-09-03" @default.
- W4287672570 modified "2023-09-26" @default.
- W4287672570 title "New Results and Bounds on Online Facility Assignment Problem" @default.
- W4287672570 doi "https://doi.org/10.48550/arxiv.2009.01446" @default.
- W4287672570 hasPublicationYear "2020" @default.
- W4287672570 type Work @default.
- W4287672570 citedByCount "0" @default.
- W4287672570 crossrefType "posted-content" @default.
- W4287672570 hasAuthorship W4287672570A5001115259 @default.
- W4287672570 hasAuthorship W4287672570A5054894469 @default.
- W4287672570 hasAuthorship W4287672570A5061722991 @default.
- W4287672570 hasBestOaLocation W42876725701 @default.
- W4287672570 hasConcept C102408133 @default.
- W4287672570 hasConcept C108005400 @default.
- W4287672570 hasConcept C114614502 @default.
- W4287672570 hasConcept C126255220 @default.
- W4287672570 hasConcept C127413603 @default.
- W4287672570 hasConcept C132525143 @default.
- W4287672570 hasConcept C132829578 @default.
- W4287672570 hasConcept C134306372 @default.
- W4287672570 hasConcept C154945302 @default.
- W4287672570 hasConcept C176217482 @default.
- W4287672570 hasConcept C177264268 @default.
- W4287672570 hasConcept C196921405 @default.
- W4287672570 hasConcept C199360897 @default.
- W4287672570 hasConcept C21547014 @default.
- W4287672570 hasConcept C33923547 @default.
- W4287672570 hasConcept C41008148 @default.
- W4287672570 hasConcept C51823790 @default.
- W4287672570 hasConcept C77553402 @default.
- W4287672570 hasConceptScore W4287672570C102408133 @default.
- W4287672570 hasConceptScore W4287672570C108005400 @default.
- W4287672570 hasConceptScore W4287672570C114614502 @default.
- W4287672570 hasConceptScore W4287672570C126255220 @default.
- W4287672570 hasConceptScore W4287672570C127413603 @default.
- W4287672570 hasConceptScore W4287672570C132525143 @default.
- W4287672570 hasConceptScore W4287672570C132829578 @default.
- W4287672570 hasConceptScore W4287672570C134306372 @default.
- W4287672570 hasConceptScore W4287672570C154945302 @default.
- W4287672570 hasConceptScore W4287672570C176217482 @default.
- W4287672570 hasConceptScore W4287672570C177264268 @default.
- W4287672570 hasConceptScore W4287672570C196921405 @default.
- W4287672570 hasConceptScore W4287672570C199360897 @default.
- W4287672570 hasConceptScore W4287672570C21547014 @default.
- W4287672570 hasConceptScore W4287672570C33923547 @default.
- W4287672570 hasConceptScore W4287672570C41008148 @default.
- W4287672570 hasConceptScore W4287672570C51823790 @default.
- W4287672570 hasConceptScore W4287672570C77553402 @default.
- W4287672570 hasLocation W42876725701 @default.
- W4287672570 hasOpenAccess W4287672570 @default.
- W4287672570 hasPrimaryLocation W42876725701 @default.
- W4287672570 hasRelatedWork W1506355634 @default.
- W4287672570 hasRelatedWork W2006805721 @default.
- W4287672570 hasRelatedWork W2070546659 @default.
- W4287672570 hasRelatedWork W2121154134 @default.
- W4287672570 hasRelatedWork W2122381782 @default.
- W4287672570 hasRelatedWork W2534143023 @default.
- W4287672570 hasRelatedWork W2808857600 @default.
- W4287672570 hasRelatedWork W2964121702 @default.
- W4287672570 hasRelatedWork W4280563833 @default.
- W4287672570 hasRelatedWork W4287672570 @default.
- W4287672570 isParatext "false" @default.
- W4287672570 isRetracted "false" @default.
- W4287672570 workType "article" @default.