Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Theory of computation → Online algorithms"'
We consider a generalization of the fundamental online metrical service systems (MSS) problem where the feasible region can be transformed between requests. In this problem, which we call T-MSS, an algorithm maintains a point in a metric space and ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7021dfd8356e4c89b53ecbb6f811e21f
https://ora.ox.ac.uk/objects/uuid:5343eeea-11f0-486b-ac4f-ada01833d71b
https://ora.ox.ac.uk/objects/uuid:5343eeea-11f0-486b-ac4f-ada01833d71b
Publikováno v:
ACM Transactions on Algorithms. 18:1-27
In this paper, we initiate the study of the weighted paging problem with predictions. This continues the recent line of work in online algorithms with predictions, particularly that of Lykouris and Vassilvitski (ICML 2018) and Rohatgi (SODA 2020) on
We consider the problem of finding an incremental solution to a cardinality-constrained maximization problem that not only captures the solution for a fixed cardinality, but also describes how to gradually grow the solution as the cardinality bound i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cf643c80315063a7123ced626bfad2c
http://arxiv.org/abs/2305.01310
http://arxiv.org/abs/2305.01310
Autor:
Touitou, Noam
Clairvoyant network design with deadlines or delay has been studied extensively, culminating in an O(log n)-competitive general framework, where n is the number of possible request types (Azar and Touitou, FOCS 2020). In the nonclairvoyant setting, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5746170d0fbc6efeba90499a40af6f99
Autor:
Cheu, Albert, Yan, Chao
We consider protocols where users communicate with multiple servers to perform a computation on the users' data. An adversary exerts semi-honest control over many of the parties but its view is differentially private with respect to honest users. Pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d35c0bc81b2874ed6481e29f40ef8bb1
We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired set of items, and has a private value for being assigned an item in her
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cb65be74c6b9be57cf2723994fa884d
Autor:
Qiao, Mingda, Valiant, Gregory
We study a "pen testing" problem, in which we are given $n$ pens with unknown amounts of ink $X_1, X_2, \ldots, X_n$, and we want to choose a pen with the maximum amount of remaining ink in it. The challenge is that we cannot access each $X_i$ direct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a357af4d1958e4f733225c003a187c5
Autor:
Klimm, Max, Knaack, Martin
This paper studies the problem of maximizing a monotone submodular function under an unknown knapsack constraint. A solution to this problem is a policy that decides which item to pack next based on the past packing history. The robustness factor of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::295c5a8494a84e72066e3d5deafd45ce
http://arxiv.org/abs/2209.09668
http://arxiv.org/abs/2209.09668
Motivated by placement of jobs in physical machines, we introduce and analyze the problem of online recoloring, or online disengagement. In this problem, we are given a set of n weighted vertices and a k-coloring of the vertices (vertices represent j
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d5b928215223b443ffdb511f7cb1108
https://doi.org/10.21203/rs.3.rs-1998221/v1
https://doi.org/10.21203/rs.3.rs-1998221/v1
Autor:
Bansal, N, Coester, C
We introduce a general online allocation problem that connects several of the most fundamental problems in online optimization. Let M be an n-point metric space. Consider a resource that can be allocated in arbitrary fractions to the points of M. At
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d6fe76900c865a71fa990c3a0116553