:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Mukhopadhyay, Asish, John, Daniel, Sarweh, Lucas
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Combinatorics E.1; F.2; G.4
Accesso online:	https://arxiv.org/abs/2410.18999
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
di: Krawczyk, Tomasz
Pubblicazione: (2024)

Weisfeiler-Leman on graphs of small twin-width
di: Heinrich, Irene, et al.
Pubblicazione: (2026)

New Entropy Measures for Tries with Applications to the XBWT
di: Carfagna, Lorenzo, et al.
Pubblicazione: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
di: Sitters, René
Pubblicazione: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
di: Lahtin, Ivan, et al.
Pubblicazione: (2026)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
di: Chen, Yijia, et al.
Pubblicazione: (2023)

Better Approximation for Weighted $k$-Matroid Intersection
di: Singer, Neta, et al.
Pubblicazione: (2024)

A (Weakly) Polynomial Algorithm for AIVF Coding
di: Dolatabadi, Reza Hosseini, et al.
Pubblicazione: (2024)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
di: Pulyassary, Haripriya, et al.
Pubblicazione: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
di: Kumar, Nikhil, et al.
Pubblicazione: (2025)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
di: Dolatabadi, Reza Hosseini, et al.
Pubblicazione: (2024)

Faster shortest-path algorithms using the acyclic-connected tree
di: Stefansson, Elis, et al.
Pubblicazione: (2025)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
di: Baruchel, Thomas
Pubblicazione: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2024)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
di: Bell, Tolson, et al.
Pubblicazione: (2024)

The Minimum Subgraph Complementation Problem
di: Gutiérrez, Juan, et al.
Pubblicazione: (2025)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
di: Bushnell, Brian
Pubblicazione: (2026)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
di: Krawczyk, Tomasz
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

On $k$-connectivity oracles in $k$-connected graphs
di: Nutov, Zeev
Pubblicazione: (2026)

Polyhedral approach to weighted connected matchings in general graphs
di: Samer, Phillippe, et al.
Pubblicazione: (2023)

Optimal Preprocessing for Answering On-Line Product Queries
di: Alon, Noga, et al.
Pubblicazione: (2024)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
di: Brodal, Gerth Stølting
Pubblicazione: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
di: Garg, Ishant
Pubblicazione: (2026)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
di: Ma, Will, et al.
Pubblicazione: (2024)

Online Bipartite Matching in the Probe-Commit Model
di: Borodin, Allan, et al.
Pubblicazione: (2023)

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
di: Mukherjee, Sayan, et al.
Pubblicazione: (2025)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
di: MacRury, Calum, et al.
Pubblicazione: (2022)

Reserve Matching with Thresholds
di: Evren, Suat
Pubblicazione: (2023)

Restless reachability problems in temporal graphs
di: Thejaswi, Suhas, et al.
Pubblicazione: (2020)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
di: Randolph, Tim, et al.
Pubblicazione: (2024)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
di: Streit, Robert P., et al.
Pubblicazione: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
di: Shota, Kan, et al.
Pubblicazione: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
di: Adamson, Duncan, et al.
Pubblicazione: (2023)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
di: Kanellopoulos, Sotiris, et al.
Pubblicazione: (2025)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
di: Bhattacharjee, Rajarshi, et al.
Pubblicazione: (2024)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
di: Bhattacharjee, Rajarshi, et al.
Pubblicazione: (2023)

Faster Mixing for Triangulations via Transport Flows
di: Alev, Vedat Levi, et al.
Pubblicazione: (2026)