Imagen de Portada

Optimizing Periodic Operations for Efficient Inland Waterway Lock Management

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Golak, Julian, Grigoriev, Alexander, van Lent, Freija, van der Zanden, Tom
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
por: Grigoriev, Alexander, et al.
Publicado: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
por: Ma, Zihang
Publicado: (2025)

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

Finding Order-Preserving Subgraphs
por: Imamura, Haruya, et al.
Publicado: (2025)

The Fair Periodic Assignment Problem
por: van Lieshout, Rolf, et al.
Publicado: (2025)

Tight Bounds for Sorting Under Partial Information
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Online busy time scheduling with flexible jobs
por: Albers, Susanne, et al.
Publicado: (2024)

Hedonic Seat Arrangement Problems
por: Bodlaender, Hans L., et al.
Publicado: (2020)

Efficient Computation of Periods and Covers Using Sampling
por: Lecroq, Thierry, et al.
Publicado: (2024)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

A Lock-free Binary Trie
por: Ko, Jeremy
Publicado: (2024)

Single-Source Regular Path Querying in Terms of Linear Algebra
por: Belyanin, Georgiy, et al.
Publicado: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Efficient Greedy Discrete Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Online Makespan Minimization: Beat LPT by Dynamic Locking
por: Wang, Zhaozi, et al.
Publicado: (2023)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
por: Grus, Josef, et al.
Publicado: (2024)

From Dynamic Programs to Greedy Algorithms
por: van Melkebeek, Dieter
Publicado: (2025)

Optimizing Wiggle in Storylines
por: Dobler, Alexander, et al.
Publicado: (2025)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

On computing the (exact) Fréchet distance with a frog
por: Conradi, Jacobus, et al.
Publicado: (2025)

Engineering Fully Dynamic Convex Hulls
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Data Structures for Approximate Discrete Fréchet Distance
por: van der Hoog, Ivor, et al.
Publicado: (2022)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
por: Haas, Niklas, et al.
Publicado: (2025)

Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
por: Hu, Ivan, et al.
Publicado: (2022)

Computing Flows in Subquadratic Space
por: Brand, Jan van den, et al.
Publicado: (2026)

Dynamic Rank, Basis, and Matching
por: Brand, Jan van den, et al.
Publicado: (2026)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
por: Dempsey, Jordan, et al.
Publicado: (2024)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
por: Conradi, Jacobus, et al.
Publicado: (2026)

Succinct Planar Encoding with Minor Operations
por: Kammer, Frank, et al.
Publicado: (2023)

Approximating $δ$-Covering
por: Hartmann, Tim A., et al.
Publicado: (2024)

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
por: Brand, Jan van den, et al.
Publicado: (2025)

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
por: van Iersel, Leo, et al.
Publicado: (2026)

Improved online load balancing with known makespan
por: Böhm, Martin, et al.
Publicado: (2024)

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
por: Esposito, Emmanuel, et al.
Publicado: (2022)

When is String Reconstruction using de Bruijn Graphs Hard?
por: Bals, Ben, et al.
Publicado: (2025)