Výsledky vyhledávání - "Computer Science - Data Structures and Algorithms"

Approximation Algorithms for Covering Vertices by Long Paths Autor Gong, Mingyang, Edgar, Brett, Fan, Jing, Lin, Guohui, Miyano, Eiji

Získat plný text

Introduction to local certification Autor Feuilloley, Laurent

“… As distributed environment are subject to faults, an important issue is to be able to check that the output is correct, or in general that the network is in proper configuration with respect to some predicate…”
Získat plný text

Longest Gapped Repeats and Palindromes Autor Dumitran, Marius, Gawrychowski, Paweł, Manea, Florin

“…$, the longest gapped repeat and palindrome occurring at that position, provided that the length of the gap is subject to various types of restrictions…”
Získat plný text

A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem Autor Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, Hoong Chuin Lau

Získat plný text

On maximizing a monotone <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll">k</mml:math>-submodular function subject to a matroid constraint Autor Shinsaku Sakaue

Získat plný text

Barter Exchange with Shared Item Valuations Autor Luque, Juan, Duppala, Sharmila, Dickerson, John, Srinivasan, Aravind

“… The goal is to compute a (re)allocation of items maximizing the agents' collective utility subject to each agent's total received value being comparable to their total given value…”
Získat plný text

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time Autor Hua, Kevin, Li, Daniel, Park, Jaewoo, Saranurak, Thatchaphol

“…We show the first near-linear time randomized algorithms for listing all minimum vertex cuts of polylogarithmic size that separate the graph into at least…”
Získat plný text

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint Autor Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Reiffenhäuser, Rebecca

“…) submodular function subject to a knapsack constraint. We present a simple randomized greedy algorithm that achieves a \(5.83…”
Získat plný text

Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time Autor Chen, Yixin, Kuhnle, Alan

“…In this work, we study the problem of finding the maximum value of a non-negative submodular function subject to a limit on the number of items selected, a ubiquitous problem that appears in many…”
Získat plný text

Balancing Utility and Fairness in Submodular Maximization (Technical Report) Autor Wang, Yanhao, Li, Yuchen, Bonchi, Francesco, Wang, Ying

“…Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence…”
Získat plný text

Optimal Dynamic Subset Sampling: Theory and Applications Autor Lu, Yi, Wang, Hanzhi, Wei, Zhewei

“…We study the fundamental problem of sampling independent events, called subset sampling. Specifically, consider a set of \(n\) events \(S=\{x_1, \ldots,…”
Získat plný text

Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph Autor Zinder, Yakov, Berlińska, Joanna, Peter, Charlie

“…The paper considers scheduling on parallel machines under the constraint that some pairs of jobs cannot be processed concurrently. Each job has an associated…”
Získat plný text

Approximation Algorithms for Clustering with Dynamic Points Autor Deng, Shichuan, Li, Jian, Rabani, Yuval

“… In these dynamic clustering problems, the general goal is to minimize certain combinations of the service cost of points and the movement cost of centers, or to minimize one subject to some constraints on the other…”
Získat plný text

Distinct Elements in Streams: An Algorithm for the (Text) Book Autor Chakraborty, Sourav, Vinodchandran, N V, Meel, Kuldeep S

“…{A}\).Distinct Elements has been a subject of theoretical and empirical investigations over the past four decades resulting in space optimal algorithms…”
Získat plný text

Minimizing Congestion for Balanced Dominators Autor Mizutani, Yosuke, Staker, Annie, Sullivan, Blair D

“…A primary challenge in metagenomics is reconstructing individual microbial genomes from the mixture of short fragments created by sequencing. Recent work…”
Získat plný text

An empirical estimation for time and memory algorithm complexities: newly developed R package Autor Agenis-Nevers, Marc, Bokde, Neeraj Dhanraj, Yaseen, Zaher Mundher, Shende, Mayur

“…This article introduces GuessCompx which is an R package that performs an empirical estimation on the time and memory complexities of an algorithm or a…”
Získat plný text

Tight Approximation Bounds for Maximum Multi-Coverage Autor Barman, Siddharth, Omar, Fawzi, Ghoshal, Suprovat, Gürpınar, Emirhan

“…In the classic maximum coverage problem, we are given subsets \(T_1, \dots, T_m\) of a universe \([n]\) along with an integer \(k\) and the objective is to…”
Získat plný text

Tableless Calculation of Circular Functions on Dyadic Rationals Autor Kourzanov, Peter

“…I would like to tell a story. A story about a beautiful mathematical relationship that elucidates the computational view on the classic subject of trigonometry…”
Získat plný text

Longest Gapped Repeats and Palindromes Autor Dumitran, Marius, Gawrychowski, Paweł, Manea, Florin

“…\), the longest gapped repeat and palindrome occurring at that position, provided that the length of the gap is subject to various types of restrictions…”
Získat plný text

Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint Autor Karapetyan, Areg, Khonji, Majid, Chi-Kin Chau, Elbassioni, Khaled

“… In this paper, we present a competitive randomized online algorithm for deciding whether a sequence of inelastic demands can be allocated for the requested intervals, subject to the total satisfiable apparent power within a time-varying capacity constraint. We also consider an alternative setting with nodal voltage constraint, using a variant of the online algorithm. Finally, simulation studies are provided to evaluate the algorithms empirically…”
Získat plný text