Cover Image

On the Power of Spatial Locality on Online Routing Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guragain, Swapnil, Sharma, Gokarna
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Multiagent Systems Robotics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Augmented Online TRP on a Line
by: Guragain, Swapnil, et al.
Published: (2026)

Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)

Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)

Smooth Routing in Decaying Trees
by: Fluschnik, Till, et al.
Published: (2026)

Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)

Group Trip Planning Query Problem with Multimodal Journey
by: Ali, Dildar, et al.
Published: (2025)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
by: Das, Arun Kumar, et al.
Published: (2025)

Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle
by: Kim, Jaekwang, et al.
Published: (2023)

Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading
by: Adiga, Abhijin, et al.
Published: (2024)

Time and Supply Fairness in Electricity Distribution using $k$-times bin packing
by: Baghel, Dinesh Kumar, et al.
Published: (2026)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Secure and secret cooperation in robotic swarms
by: Ferrer, Eduardo Castelló, et al.
Published: (2019)

Recognizing and Eliciting Weakly Single Crossing Profiles on Trees
by: Dey, Palash
Published: (2016)

Optimally Improving Cooperative Learning in a Social Setting
by: Haddadan, Shahrzad, et al.
Published: (2024)

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
by: Kulkarni, Pooja, et al.
Published: (2025)

Group Fair Matchings using Convex Cost Functions
by: Panda, Atasi, et al.
Published: (2025)

Improved MMS Approximations for Few Agent Types
by: Garg, Jugal, et al.
Published: (2025)

Maximizing Value in Challenge the Champ Tournaments
by: Bhaskar, Umang, et al.
Published: (2025)

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
by: Cosson, Romain, et al.
Published: (2025)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)

Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Equilibria in multiagent online problems with predictions
by: Istrate, Gabriel, et al.
Published: (2024)

EFX Exists for Three Types of Agents
by: HV, Vishwa Prakash, et al.
Published: (2024)

Leakage-Robust Bayesian Persuasion
by: Haghtalab, Nika, et al.
Published: (2024)

Platforms for Efficient and Incentive-Aware Collaboration
by: Haghtalab, Nika, et al.
Published: (2024)

Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
by: Csáji, Gergely
Published: (2023)

Accelerating Probabilistic Response-Time Analysis: Revised Critical Instant and Optimized Convolution
by: Takahashi, Hiroto, et al.
Published: (2025)

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
by: Zhang, Taining, et al.
Published: (2023)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
by: Hummel, Halvard, et al.
Published: (2024)

Forming Large Patterns with Local Robots in the OBLOT Model
by: Hahn, Christopher, et al.
Published: (2024)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
by: Philip, Allen George, et al.
Published: (2023)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)

Early Pruning for Public Transport Routing
by: Rohovyi, Andrii, et al.
Published: (2026)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
by: Geft, Tzvika, et al.
Published: (2025)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
by: Gerlach, Raphael, et al.
Published: (2024)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
by: Bentert, Matthias, et al.
Published: (2024)