Výsledky vyhľadávania - "dynamic algorithms"

Point enclosure problem for homothetic polygons Autor Akram, Waseem, Saxena, Sanjeev

“…In this paper, we investigate the following problem: “given a set S of n homothetic polygons, preprocess S to efficiently report all the polygons of S…”
Získať plný text

Dynamic Deterministic Constant-Approximate Distance Oracles with n^ Worst-Case Update Time Autor Haeupler, Bernhard, Long, Yaowei, Saranurak, Thatchaphol

“…We present a new distance oracle in the fully dynamic setting: given a weighted undirected graph G = (V, E) with n vertices undergoing both edge insertions and…”
Získať plný text

Dynamic fuzzy neighborhood rough set approach for interval-valued information systems with fuzzy decision Autor Yang, Lei, Qin, Keyun, Sang, Binbin, Xu, Weihua

“…Nowadays, many extended rough set models are proposed to acquire valuable knowledge from interval-valued information system. These existing models mainly focus…”
Získať plný text

Dynamic and Internal Longest Common Substring Autor Amir, Amihood, Charalampopoulos, Panagiotis, Pissis, Solon P., Radoszewski, Jakub

“…Given two strings S and T , each of length at most n , the longest common substring (LCS) problem is to find a longest substring common to S and T . This is a…”
Získať plný text

A note on improved results for one round distributed clique listing Autor Liu, Quanquan C.

“…In this note, we investigate listing cliques of arbitrary sizes in bandwidth-limited, dynamic networks. The problem of detecting and listing triangles and…”
Získať plný text

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds Autor van den Brand, Jan, Nanongkai, Danupon, Saranurak, Thatchaphol

“…The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best…”
Získať plný text

Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract) Autor Jin, Wenyu, Sun, Xiaorui

“…We present a deterministic fully dynamic algorithm to answer c-edge connectivity queries on pairs of vertices in n°(1) worst case update and query time for any…”
Získať plný text

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time Autor Chechik, Shiri, Zhang, Tianyi

“…In the fully dynamic maximal independent set (MIS) problem our goal is to maintain an MIS in a given graph G while edges are inserted and deleted from the…”
Získať plný text

Fully Dynamic k-\text with Fast Update Time and Small Recourse Autor Bhattacharya, Sayan, Costa, Martin, Garg, Naveen, Lattanzi, Silvio, Parotsidis, Nikos

“…In the dynamic metric k-\mathbf{median} problem, we wish to maintain a set of k centers S\subseteq V in an input metric space (V, d) that gets updated via…”
Získať plný text

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling Autor Compton, Spencer, Mitrović, Slobodan, Rubinfeld, Ronitt

“…Interval scheduling is a basic algorithmic problem and a classical task in combinatorial optimization. We develop techniques for partitioning and grouping jobs…”
Získať plný text

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time Autor van den Brand, Jan, Nanongkai, Danupon

“…Consider the following distance query for an n-node graph G undergoing edge insertions and deletions: given two sets of nodes I and J, return the distances…”
Získať plný text

Fully-Dynamic Submodular Cover with Bounded Recourse Autor Gupta, Anupam, Levin, Roie

“…In submodular covering problems, we are given a monotone, nonnegative submodular function f:2^{\mathcal{N}}\rightarrow \mathbb{R}_{+} and wish to find the…”
Získať plný text

Deterministic Dynamic Matching in Worst-Case Update Time Autor Kiss, Peter

“…We present deterministic algorithms for maintaining a ( 3 / 2 + ϵ ) and ( 2 + ϵ ) -approximate maximum matching in a fully dynamic graph with worst-case update…”
Získať plný text

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs Autor Behnezhad, Soheil, Ghafari, Alma

“…We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is…”
Získať plný text

On Dynamic Shortest Paths Problems Autor Roditty, Liam, Zwick, Uri

“…We obtain the following results related to dynamic versions of the shortest-paths problem: Reductions that show that the incremental and decremental…”
Získať plný text

Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs Autor Beisegel, Jesse, Köhler, Ekkehard, Scheffler, Robert, Strehler, Martin

“…Solving problems on graphs dynamically calls for algorithms to function under repeated modifications to the graph and to be more efficient than solving the…”
Získať plný text

Deterministic Dynamic Matching in O(1) Update Time Autor Bhattacharya, Sayan, Chakrabarty, Deeparnab, Henzinger, Monika

“…We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of…”
Získať plný text

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters Autor Hanauer, Kathrin, Henzinger, Monika, Ost, Lara, Schmid, Stefan

“…Emerging reconfigurable datacenters allow to dynamically adjust the network topology in a demand-aware manner. These datacenters rely on optical switches which…”
Získať plný text

Dynamic Kernels for Hitting Sets and Set Packing Autor Bannach, Max, Heinrich, Zacharias, Reischuk, Rüdiger, Tantau, Till

“…Computing small kernels for the hitting set problem is a well-studied computational problem where we are given a hypergraph with n  vertices and m  hyperedges,…”
Získať plný text

A New Deterministic Algorithm for Dynamic Set Cover Autor Bhattacharya, Sayan, Henzinger, Monika, Nanongkai, Danupon

“…We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the…”
Získať plný text