The Wayback Machine - https://webcf.waybackmachine.org/web/20211006122259/https://dl.acm.org/toc/talg/2021/17/4
Volume 17, Issue 4October 2021Current Issue
Bibliometrics
research-article
Sublinear Random Access Generators for Preferential Attachment Graphs
October 2021, Article No.: 28, pp 1–26https://doi.org/10.1145/3464958

We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space, and randomness complexities of such samplers.

In the standard approach, the whole ...

research-article
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
October 2021, Article No.: 29, pp 1–51https://doi.org/10.1145/3469833

Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, ...

    research-article
    Smaller Cuts, Higher Lower Bounds
    October 2021, Article No.: 30, pp 1–40https://doi.org/10.1145/3469834

    This article proves strong lower bounds for distributed computing in the congest model, by presenting the bit-gadget: a new technique for constructing graphs with small cuts.

    The contribution of bit-gadgets is twofold. First, developing careful sparse ...

    research-article
    Querying a Matrix through Matrix-Vector Products
    October 2021, Article No.: 31, pp 1–19https://doi.org/10.1145/3470566

    We consider algorithms with access to an unknown matrix M ε F n×d via matrix-vector products, namely, the algorithm chooses vectors v1, ⃛ , vq, and observes Mv1, ⃛ , Mvq. Here the vi can be randomized as well as chosen adaptively as a function of Mv1, ⃛ , ...

    research-article
    The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
    October 2021, Article No.: 32, pp 1–29https://doi.org/10.1145/3449350

    Given an ideal I and a polynomial f the Ideal Membership Problem (IMP) is to test if f ϵ I. This problem is a fundamental algorithmic problem with important applications and notoriously intractable.

    We study the complexity of the IMP for combinatorial ...

    research-article
    Approximating Geometric Knapsack via L-packings
    October 2021, Article No.: 33, pp 1–67https://doi.org/10.1145/3473713

    We study the two-dimensional geometric knapsack problem, in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) packing of a maximum ...

    research-article
    Zip Trees
    October 2021, Article No.: 34, pp 1–12https://doi.org/10.1145/3476830

    We introduce the zip tree,1 a form of randomized binary search tree that integrates previous ideas into one practical, performant, and pleasant-to-implement package. A zip tree is a binary search tree in which each node has a numeric rank and the tree is (...

    research-article
    Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    October 2021, Article No.: 35, pp 1–12https://doi.org/10.1145/3478537

    We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem. Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that minimizes its bottleneck (or maximum-...

    research-article
    Better Distance Preservers and Additive Spanners
    October 2021, Article No.: 36, pp 1–24https://doi.org/10.1145/3490147

    We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work on distance ...

    Subjects

    Communication complexityComplexity classesComputational complexity and cryptographyDesign and analysis of algorithmsDiscrete optimizationDynamic graph algorithmsExtremal graph theoryGenerating random combinatorial structuresGraph algorithmsPacking and covering problemsPaths and connectivity problemsProbabilistic algorithmsRouting and network design problemsSorting and searchingStreaming, sublinear and near linear time algorithmsTrees

    Comments

    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!