:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schild, Aaron, Gollapudi, Sreenivas, Gupta, Anupam, Kollias, Kostas, Sinop, Ali
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2506.05604
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

First Passage Percolation with Queried Hints
par: Karntikoon, Kritkorn, et autres
Publié: (2024)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
par: Caragiannis, Ioannis, et autres
Publié: (2026)

Compact Conformal Subgraphs
par: Gollapudi, Sreenivas, et autres
Publié: (2026)

Online Distributed Queue Length Estimation
par: Bhaskara, Aditya, et autres
Publié: (2025)

Data Exchange Markets via Utility Balancing
par: Bhaskara, Aditya, et autres
Publié: (2024)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
par: Awasthi, Pranjal, et autres
Publié: (2025)

Efficient Online Conformal Selection with Limited Feedback
par: Gollapudi, Sreenivas, et autres
Publié: (2026)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
par: Zhao, Jingyang, et autres
Publié: (2022)

Routing-Controlled Spanners
par: Grigorescu, Elena, et autres
Publié: (2024)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Steiner Forest: A Simplified Better-Than-2 Approximation
par: Gupta, Anupam, et autres
Publié: (2025)

Fully-Dynamic Submodular Cover with Bounded Recourse
par: Gupta, Anupam, et autres
Publié: (2020)

Near-optimal Algorithms for Stochastic Online Bin Packing
par: Ayyadevara, Nikhil, et autres
Publié: (2022)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing
par: Uroić, Leon Stjepan, et autres
Publié: (2026)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
par: Gibbons, Ethan, et autres
Publié: (2026)

Improved Approximation Algorithms for Three-Dimensional Knapsack
par: Jansen, Klaus, et autres
Publié: (2025)

Optimal Electrical Oblivious Routing on Expanders
par: Florescu, Cella, et autres
Publié: (2024)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

Breaking Barriers for Distributed MIS by Faster Degree Reduction
par: Khoury, Seri, et autres
Publié: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
par: Anand, Aditya, et autres
Publié: (2025)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
par: Chekuri, Chandra, et autres
Publié: (2024)

A Learning Perspective on Random-Order Covering Problems
par: Gupta, Anupam, et autres
Publié: (2025)

Random Order Set Cover is as Easy as Offline
par: Gupta, Anupam, et autres
Publié: (2021)

The En Route Truck-Drone Delivery Problem
par: Krizanc, Danny, et autres
Publié: (2024)

Faster All-Pairs Optimal Electric Car Routing
par: Dorfman, Dani, et autres
Publié: (2025)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
par: Zhao, Jingyang, et autres
Publié: (2023)

Temporal Routing in Static Networks: The Schedule Completion Problem
par: Döring, Michelle, et autres
Publié: (2026)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
par: Baswana, Surender, et autres
Publié: (2025)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing
par: Held, Stephan, et autres
Publié: (2025)

Pairwise-Independent Contention Resolution
par: Gupta, Anupam, et autres
Publié: (2024)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

Smooth Routing in Decaying Trees
par: Fluschnik, Till, et autres
Publié: (2026)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
par: Friggstad, Zachary, et autres
Publié: (2025)

Optimized Customizable Route Planning in Large Road Networks with Batch Processing
par: Farhan, Muhammad, et autres
Publié: (2026)