:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Nguyen, Linh Anh
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2407.01052
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximate minimization of interpretations in fuzzy description logics under the Gödel semantics
por: Nguyen, Linh Anh
Publicado: (2025)

A computational study of Gomory-Hu construction tree algorithms
por: Kolmogorov, Vladimir
Publicado: (2022)

Efficient algorithm for linear diophantine equations in two variables
por: Deora, Mayank, et al.
Publicado: (2025)

Phase transition of the Sinkhorn-Knopp algorithm
por: He, Kun
Publicado: (2025)

A more efficient algorithm to compute the Rand Index for change-point problems
por: Prates, Lucas de Oliveira
Publicado: (2021)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
por: Tran, Nguyen Khoa, et al.
Publicado: (2026)

Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
por: Nguyen, Tuan-Anh, et al.
Publicado: (2024)

The clustered Sparrow algorithm
por: Dumitrescu, Cristian
Publicado: (2018)

Parameterized algorithms for $k$-Inversion
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Streaming algorithms for products of probabilities
por: Lohrey, Markus, et al.
Publicado: (2025)

Locally computing edge orientations
por: Mitrović, Slobodan, et al.
Publicado: (2025)

Generalized $k$-Center: Distinguishing Doubling and Highway Dimension
por: Feldmann, Andreas Emil, et al.
Publicado: (2022)

Engineering Semi-streaming DFS algorithms
por: Bhagavan, Kancharla Nikhilesh, et al.
Publicado: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
por: Leonhardt, Alexander, et al.
Publicado: (2024)

Practical algorithms for Hierarchical overlap graphs
por: Talera, Saumya, et al.
Publicado: (2024)

A practical algorithm for 3-admissibility
por: Awofeso, Christine, et al.
Publicado: (2025)

New algorithms for girth and cycle detection
por: Roditty, Liam, et al.
Publicado: (2025)

Optimal bounds on a tree inference algorithm
por: Gardiner, Jack, et al.
Publicado: (2024)

An FPT algorithm for Matching Cut and d-cut
por: Aravind, N R, et al.
Publicado: (2021)

Strassen's algorithm via orbit flip graphs
por: Ikenmeyer, Christian, et al.
Publicado: (2025)

Faster parameterized algorithm for 3-Hitting Set
por: Tsur, Dekel
Publicado: (2025)

Minimum sum vertex cover: kernelization and parameterized algorithms
por: Cao, Yixin, et al.
Publicado: (2024)

Faster algorithms for packing forests in graphs and related problems
por: Arkhipov, Pavel, et al.
Publicado: (2024)

SquareSort: a cache-oblivious sorting algorithm
por: Koucký, Michal, et al.
Publicado: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
por: Dürr, Anita, et al.
Publicado: (2025)

Fast exact algorithms via the Matrix Tree Theorem
por: Arvind, V., et al.
Publicado: (2025)

Approximation algorithms for satisfiable and nearly satisfiable ordering CSPs
por: Makarychev, Yury
Publicado: (2026)

New simple and fast quicksort algorithm for equal keys
por: Afereidoon, Parviz
Publicado: (2025)

Composing dynamic programming tree-decomposition-based algorithms
por: Baste, Julien
Publicado: (2019)

Parallel batch queries on dynamic trees: algorithms and experiments
por: Ikram, Humza, et al.
Publicado: (2025)

FPT algorithms over linear delta-matroids with applications
por: Eiben, Eduard, et al.
Publicado: (2025)

Quasilinear-time eccentricities computation, and more, on median graphs
por: Bergé, Pierre, et al.
Publicado: (2024)

A customizable inexact subgraph matching algorithm for attributed graphs
por: Benko, Tatyana, et al.
Publicado: (2025)

Approximation and parameterized algorithms for covering disjointness-compliable set families
por: Nutov, Zeev, et al.
Publicado: (2025)

Round-efficient Fully-scalable MPC algorithms for k-Means
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2026)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
por: Fischer, David, et al.
Publicado: (2022)

Optimal FIFO grouping in public transit networks
por: Steil, Patrick
Publicado: (2023)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
por: Eden, Talya, et al.
Publicado: (2025)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
por: Yang, Connor, et al.
Publicado: (2025)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
por: Kratsch, Stefan
Publicado: (2026)