Imagen de Portada

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Klein, Kim-Manuel, Reuter, Janina
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics Algebraic Geometry 90C99 F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
por: Elbassioni, Khaled
Publicado: (2025)

Faster algorithms on linear delta-matroids
por: Koana, Tomohiro, et al.
Publicado: (2024)

Loop unrolling of UCA models: distance labeling
por: Soulignac, Francisco J, et al.
Publicado: (2022)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Computing parameters that generalize interval graphs using restricted modular partitions
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
por: Jacob, Ashwin, et al.
Publicado: (2026)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
por: Chen, Yongyu
Publicado: (2023)

Sparse Induced Subgraphs of Large Treewidth
por: Bonnet, Édouard
Publicado: (2024)

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

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

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

A Decomposition Approach to the Weighted $k$-server Problem
por: Ayyadevara, Nikhil, et al.
Publicado: (2024)

Robust Permutation Flowshops Under Budgeted Uncertainty
por: Goldberg, Noam, et al.
Publicado: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

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

Finding Diverse Solutions Parameterized by Cliquewidth
por: Drabik, Karolina, et al.
Publicado: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

Efficient Uniform Sampling of Surjections via their Profiles
por: Carayol, Arnaud, et al.
Publicado: (2026)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
por: Bonnet, Édouard, et al.
Publicado: (2023)

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

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
por: Misra, Neeldhara, et al.
Publicado: (2022)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
por: Fomin, Fedor V., et al.
Publicado: (2026)

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

Optimal distance query reconstruction for graphs without long induced cycles
por: Bastide, Paul, et al.
Publicado: (2023)

Efficient Approximation of Fractional Hypertree Width
por: Korchemna, Viktoriia, et al.
Publicado: (2024)