Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Zachary Friggstad"'
Autor:
Zachary Friggstad, Chaitanya Swamy
Publikováno v:
Journal of Computer and System Sciences. 126:44-58
We consider the directed minimum latency problem (DirLat), wherein we seek a path P visiting all points (or clients) in a given asymmetric metric starting at a given root node r, so as to minimize the sum of the client waiting times, where the waitin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65c837e4f8b678a641298ecb7ad7739d
https://doi.org/10.1016/j.jcss.2021.12.001
https://doi.org/10.1016/j.jcss.2021.12.001
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1181c57da93d3ed87592f5a924749082
https://doi.org/10.1007/978-3-031-06901-7_19
https://doi.org/10.1007/978-3-031-06901-7_19
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75244071cf5f16702cbd31e5190c5576
https://doi.org/10.1007/978-3-031-06901-7_15
https://doi.org/10.1007/978-3-031-06901-7_15
$k$-center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean version is NP-hard to approximate within a factor of 1.93, even in the plane, if one insists the de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::723c67d13a60ab59bef296bdc0af6b3a
Autor:
Zachary Friggstad, Maryam Mahboub
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
WADS
We study approximation algorithms for graph pricing with vertex capacities yet without the traditional envy-free constraint. Specifically, we have a set of items V and a set of customers X where each customer \(i \in X\) has a budget \(b_i\) and is i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f86dcbec05d7b529b7739f83a3e92e7
https://doi.org/10.1007/978-3-030-83508-8_29
https://doi.org/10.1007/978-3-030-83508-8_29
Autor:
Zachary Friggstad, Ramin Mousavi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
WADS
Correlation Clustering is a model that aims to group items according to similarity and dissimilarity measures. In general, for a given set of items V we are given weights \(w_{u,v}\) between items \(u,v \in V\) indicating how similar they are: these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7f96a9c41453fa3916cc08b28584bb6
https://doi.org/10.1007/978-3-030-83508-8_30
https://doi.org/10.1007/978-3-030-83508-8_30
Autor:
Jean-Lou De Carufel, Zachary Friggstad
Publikováno v:
Computational Geometry. 101:101776
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e9b7e257114c81f7635a20fe50e6014
https://doi.org/10.1016/j.comgeo.2021.101776
https://doi.org/10.1016/j.comgeo.2021.101776
Autor:
Mirmahdi Rahgoshay, Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour, Christopher S. Martin, Yifeng Zhang
Publikováno v:
Journal of Scheduling. 22:239-253
We consider scheduling problems in which jobs must be processed through a (shared) network of machines. The network is given in the form of a graph, the edges of which represent the machines. We are also given a set of jobs, each specified by its pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b929930c0ae224924ebdac3c597f432a
https://doi.org/10.1007/s10951-018-0591-z
https://doi.org/10.1007/s10951-018-0591-z
Publikováno v:
Algorithmica. 81:1075-1095
We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c99d00339f8ae76780bf6c17d46ae78
https://doi.org/10.1007/s00453-018-0458-x
https://doi.org/10.1007/s00453-018-0458-x
Publikováno v:
Algorithmica. 81:1006-1030
We consider two closely related fundamental clustering problems in this paper. In Min-Sumk-Clustering, one is given n points in a metric space and has to partition them into k clusters while minimizing the sum of pairwise distances between points in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::748ca797d8a72e0b464b2089651a5f89
https://doi.org/10.1007/s00453-018-0454-1
https://doi.org/10.1007/s00453-018-0454-1