Article
Computer Science, Theory & Methods
Christian Coester, Elias Koutsoupias, Philip Lazos
Summary: We study the infinite server problem and its connection to the resource augmentation version of the k-server problem. We prove a lower bound for the competitive ratio of the infinite server problem and obtain upper bounds for weighted trees and layered graphs. The infinite server problem is shown to be equivalent to a simpler case in which all requests are in a fixed bounded interval.
ACM TRANSACTIONS ON ALGORITHMS
(2021)
Article
Computer Science, Theory & Methods
Bjorn Feldkord, Till Knollmann, Friedhelm Meyer Auf der Heide
Summary: The study investigates the extended version of the Online Facility Location problem and proposes randomized online algorithms for different parameter settings. The algorithms achieve competitiveness independent of the number of clients n on the line, depending only on a constant D in the case of arbitrary movement and additionally on the movement distance m and opening costs of facilities in the case of limited movement.
THEORETICAL COMPUTER SCIENCE
(2022)
Article
Computer Science, Theory & Methods
Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi
Summary: This article introduces the online service with delay problem, presents a poly-logarithmic competitive ratio solution, and extends the results to multiple servers and some special metrics.
ACM TRANSACTIONS ON ALGORITHMS
(2021)
Article
Engineering, Multidisciplinary
Menglu Yu, Jia Liu, Chuan Wu, Bo Ji, Elizabeth S. Bentley
Summary: The rapid growth of distributed machine learning frameworks has posed technical challenges in computing system design and optimization. This paper proposes an online scheduling algorithm that optimizes resource allocation and locality decisions, achieving good performance through approximate algorithm design and analysis.
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
(2022)
Article
Operations Research & Management Science
Meghan Shanks, Sheldon H. Jacobson
Summary: This paper analyzes a variant of Online Bipartite Matching where incoming jobs need to be matched to workers even without available edges. A reward is only obtained for matchings made across an edge. The paper provides upper and lower bounds for the most general version of this variant and presents an optimal policy for this problem under certain conditions in the underlying bipartite graph.
OPTIMIZATION LETTERS
(2022)
Article
Computer Science, Software Engineering
Sandor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt
Summary: The study focuses on parallel online algorithms using k parallel processes to make online decisions, where the best result is determined from k individual total results. Developed a relatively simple family of k-copy algorithms PH3 for the online Bin Packing Problem, with a competitive factor converging to 1.5 as k increases, outperforming the known algorithms.
Article
Mathematics
Kamil Khadiev, Aliya Khadieva
Summary: In this paper, the competitive ratio of online algorithms is considered, and one-way automata are explored as a model for these algorithms. Both quantum and classical online algorithms are focused on. Specifically, a quantum log-bounded automaton is proposed for a specially constructed online minimization problem, which outperforms classical automata even with advice in terms of competitive ratio, especially when the memory size is logarithmic. Furthermore, an online version of the well-known Disjointness problem is constructed, which has been studied by many researchers from the perspective of communication complexity and query complexity.
Article
Management
Xiao-Yue Gong, Vineet Goyal, Garud N. Iyengar, David Simchi-Levi, Rajan Udwani, Shuangyu Wang
Summary: This paper investigates an online assortment optimization problem and proposes a simple myopic policy for profit maximization, showing that it is competitive with the optimal policy under full information. Additionally, it considers usage time distributions that depend on user types and demonstrates the absence of online algorithms with nontrivial competitive ratio guarantees in this case. Numerical experiments are conducted to compare the robustness and performance of the myopic policy with other natural policies.
MANAGEMENT SCIENCE
(2022)
Article
Management
Vahid Akbari, Davood Shiri
Summary: The paper studies two online variants of the minimum latency problem, one involving a certain number of blocked edges in the graph and the other associating different priority weights with each node. By introducing an optimal deterministic online algorithm, a tight lower bound on the competitive ratio is proven, and lower bounds on the expected competitive ratio of randomized online algorithms are proposed. Two polynomial time heuristic algorithms are developed to solve these online problems.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Multidisciplinary Sciences
Tianqi Wu, Jian Liu, Zhiye Guo, Jie Hou, Jianlin Cheng
Summary: This paper introduces the latest open-source protein tertiary structure prediction system MULTICOM2, which integrates template-based modeling and template-free modeling methods, capable of predicting good tertiary structures across the board. The template-free modeling method's prediction accuracy on TBM and FM targets is very close to the combination of template-based and template-free modeling methods, demonstrating that the distance-based template-free modeling method powered by deep learning can largely replace the traditional template-based modeling method even on TBM targets.
SCIENTIFIC REPORTS
(2021)
Article
Biochemistry & Molecular Biology
Luciano Porto Kagami, Gabriele Orlando, Daniele Raimondi, Francois Ancien, Bhawna Dixit, Jose Gavalda-Garcia, Pathmanaban Ramasamy, Joel Roca-Martinez, Konstantina Tzavella, Wim Vranken
Summary: The tool provides integrated protein sequence-based predictions to identify biophysical behaviour not captured by structural biology. It offers various features including early folding and disorder predictions, with results available in JSON or CSV files and accessible via API. Online visualization tools are also provided for interactive plots and explanations.
NUCLEIC ACIDS RESEARCH
(2021)
Article
Management
Dawsen Hwang, Patrick Jaillet, Vahideh Manshadi
Summary: In this study, a new demand arrival model combining both adversarial and stochastic components was proposed for online resource allocation problems. The proposed online algorithms designed under this model outperform existing ones and are adjustable to the size of the stochastic component. The research highlights the value of predictability and adaptive algorithms in online resource allocation, bridging the gap between adversarial and stochastic approaches.
OPERATIONS RESEARCH
(2021)
Article
Operations Research & Management Science
Martin Bohm, Lukasz Jez, Jiri Sgall, Pavel Vesely
Summary: This research focuses on packet scheduling under adversarial jamming, aiming to develop an algorithm with the optimal competitive ratio under certain conditions. A universal algorithm is proposed to work for any speedup and packet sizes, achieving competitive performance close to the optimum for deterministic algorithms.
ANNALS OF OPERATIONS RESEARCH
(2021)
Article
Mathematics
Jianguang Lu, Juan Tang, Bin Xing, Xianghong Tang
Summary: This paper introduces a mathematical model for the uncertain constrained k-means problem and proposes an approximate algorithm to solve it. By studying the properties of random sampling, the gap between the random sampling center and the real center is controlled to obtain important sampling properties for solving this problem.
Article
Computer Science, Hardware & Architecture
Panagiotis Oikonomou, Nikos Tziritas, Thanasis Loukopoulos, Georgios Theodoropoulos, Masatoshi Hanai, Samee U. Khan
Summary: This paper discusses the online version of the interval scheduling problem and proposes a novel algorithm for preprocessing bin packing schemes and providing job allocation recommendations based on job overlaps. Experimental results show the advantages of this approach compared to existing algorithms.
IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING
(2022)