Guardado en:
| Autores principales: | Rohovyi, Andrii, Abuaisha, Abdallah, Walsh, Toby |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2603.12592 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Adapting Dijkstra for Buffers and Unlimited Transfers
por: Katkalo, Denys, et al.
Publicado: (2026)
por: Katkalo, Denys, et al.
Publicado: (2026)
Timetable Nodes for Public Transport Network
por: Rohovyi, Andrii, et al.
Publicado: (2024)
por: Rohovyi, Andrii, et al.
Publicado: (2024)
Fast and Memory Efficient Multimodal Journey Planning with Delays
por: Katkalo, Denys, et al.
Publicado: (2026)
por: Katkalo, Denys, et al.
Publicado: (2026)
A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
por: Philip, Allen George, et al.
Publicado: (2024)
por: Philip, Allen George, et al.
Publicado: (2024)
On the Power of Spatial Locality on Online Routing Problems
por: Guragain, Swapnil, et al.
Publicado: (2025)
por: Guragain, Swapnil, et al.
Publicado: (2025)
Uncovering Fairness through Data Complexity as an Early Indicator
por: Ferreira, Juliett Suárez, et al.
Publicado: (2025)
por: Ferreira, Juliett Suárez, et al.
Publicado: (2025)
Learning to Prune Instances of Steiner Tree Problem in Graphs
por: Zhang, Jiwei, et al.
Publicado: (2022)
por: Zhang, Jiwei, et al.
Publicado: (2022)
Learning-Augmented Online TRP on a Line
por: Guragain, Swapnil, et al.
Publicado: (2026)
por: Guragain, Swapnil, et al.
Publicado: (2026)
Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity
por: Geft, Tzvika, et al.
Publicado: (2026)
por: Geft, Tzvika, et al.
Publicado: (2026)
Forming Large Patterns with Local Robots in the OBLOT Model
por: Hahn, Christopher, et al.
Publicado: (2024)
por: Hahn, Christopher, et al.
Publicado: (2024)
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
por: Mizutani, Yosuke, et al.
Publicado: (2024)
por: Mizutani, Yosuke, et al.
Publicado: (2024)
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
por: Gerlach, Raphael, et al.
Publicado: (2024)
por: Gerlach, Raphael, et al.
Publicado: (2024)
C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
por: Philip, Allen George, et al.
Publicado: (2023)
por: Philip, Allen George, et al.
Publicado: (2023)
A Space-Efficient Algebraic Approach to Robotic Motion Planning
por: Bentert, Matthias, et al.
Publicado: (2024)
por: Bentert, Matthias, et al.
Publicado: (2024)
Line Coverage with Multiple Robots: Algorithms and Experiments
por: Agarwal, Saurav, et al.
Publicado: (2022)
por: Agarwal, Saurav, et al.
Publicado: (2022)
Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
por: Geft, Tzvika, et al.
Publicado: (2025)
por: Geft, Tzvika, et al.
Publicado: (2025)
Adaptive Multi-Round Allocation with Stochastic Arrivals
por: Pan, Yuqi, et al.
Publicado: (2026)
por: Pan, Yuqi, et al.
Publicado: (2026)
Online Allocation with Unknown Shared Supply
por: Neoh, Tzeh Yuan, et al.
Publicado: (2026)
por: Neoh, Tzeh Yuan, et al.
Publicado: (2026)
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
por: Ganian, Robert, et al.
Publicado: (2026)
por: Ganian, Robert, et al.
Publicado: (2026)
Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
por: Nakamura, Kengo, et al.
Publicado: (2026)
por: Nakamura, Kengo, et al.
Publicado: (2026)
Nearly Optimal Attention Coresets
por: Liberty, Edo, et al.
Publicado: (2026)
por: Liberty, Edo, et al.
Publicado: (2026)
Scalable Algorithms for Approximate DNF Model Counting
por: Burkhardt, Paul, et al.
Publicado: (2026)
por: Burkhardt, Paul, et al.
Publicado: (2026)
A canonical generalization of OBDD
por: Capelli, Florent, et al.
Publicado: (2026)
por: Capelli, Florent, et al.
Publicado: (2026)
Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
por: Tacheny, Nicolas
Publicado: (2026)
por: Tacheny, Nicolas
Publicado: (2026)
Online Algorithms with Unreliable Guidance
por: Dallot, Julien, et al.
Publicado: (2026)
por: Dallot, Julien, et al.
Publicado: (2026)
Limited Perfect Monotonical Surrogates constructed using low-cost recursive linkage discovery with guaranteed output
por: Przewozniczek, M. W., et al.
Publicado: (2026)
por: Przewozniczek, M. W., et al.
Publicado: (2026)
Approximating Optimal Labelings for Temporal Connectivity
por: Carnevale, Daniele, et al.
Publicado: (2025)
por: Carnevale, Daniele, et al.
Publicado: (2025)
FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
por: Almansoori, Mahmood K. M., et al.
Publicado: (2025)
por: Almansoori, Mahmood K. M., et al.
Publicado: (2025)
Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
por: Nguyen, Hue T., et al.
Publicado: (2025)
por: Nguyen, Hue T., et al.
Publicado: (2025)
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)
por: Ganian, Robert, et al.
Publicado: (2025)
Efficient Detection of Exchangeable Factors in Factor Graphs
por: Luttermann, Malte, et al.
Publicado: (2024)
por: Luttermann, Malte, et al.
Publicado: (2024)
Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
por: Liu, Ruipeng, et al.
Publicado: (2025)
por: Liu, Ruipeng, et al.
Publicado: (2025)
Masked Matrix Multiplication for Emergent Sparsity
por: Wheatman, Brian, et al.
Publicado: (2024)
por: Wheatman, Brian, et al.
Publicado: (2024)
Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
por: Wang, Long, et al.
Publicado: (2025)
por: Wang, Long, et al.
Publicado: (2025)
Queueing, Predictions, and LLMs: Challenges and Open Problems
por: Mitzenmacher, Michael, et al.
Publicado: (2025)
por: Mitzenmacher, Michael, et al.
Publicado: (2025)
Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
por: Han, Yue, et al.
Publicado: (2025)
por: Han, Yue, et al.
Publicado: (2025)
Knapsack: Connectedness, Path, and Shortest-Path
por: Dey, Palash, et al.
Publicado: (2023)
por: Dey, Palash, et al.
Publicado: (2023)
A Survey on the Densest Subgraph Problem and Its Variants
por: Lanciano, Tommaso, et al.
Publicado: (2023)
por: Lanciano, Tommaso, et al.
Publicado: (2023)
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)
por: Chaudhary, Juhi, et al.
Publicado: (2024)
Stochastic Multi-round Submodular Optimization with Budget
por: Auletta, Vincenzo, et al.
Publicado: (2024)
por: Auletta, Vincenzo, et al.
Publicado: (2024)
Ejemplares similares
-
Adapting Dijkstra for Buffers and Unlimited Transfers
por: Katkalo, Denys, et al.
Publicado: (2026) -
Timetable Nodes for Public Transport Network
por: Rohovyi, Andrii, et al.
Publicado: (2024) -
Fast and Memory Efficient Multimodal Journey Planning with Delays
por: Katkalo, Denys, et al.
Publicado: (2026) -
A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
por: Philip, Allen George, et al.
Publicado: (2024) -
On the Power of Spatial Locality on Online Routing Problems
por: Guragain, Swapnil, et al.
Publicado: (2025)