:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhao, Jingyang, Xiao, Mingyu
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2308.14131
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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 the Multiple-Depot Split Delivery Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

Improved Approximations for Dial-a-Ride Problems
par: Zhao, Jingyang, et autres
Publié: (2026)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
par: Zhao, Jingyang, et autres
Publié: (2023)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
par: Zhao, Jingyang, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

The APX-hardness of the Traveling Tournament Problem
par: Zhao, Jingyang, et autres
Publié: (2023)

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

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
par: Xie, Ningyi, et autres
Publié: (2023)

FPT Approximation for Capacitated Sum of Radii
par: Jaiswal, Ragesh, et autres
Publié: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

Approximating Optimum Online for Capacitated Resource Allocation
par: Braun, Alexander, et autres
Publié: (2024)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
par: Chen, Yongyu
Publié: (2023)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
par: Segev, Danny
Publié: (2024)

New Approximation Guarantees for The Inventory Staggering Problem
par: Alon, Noga, et autres
Publié: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
par: Segev, Danny, et autres
Publié: (2025)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
par: Blum, Avrim, et autres
Publié: (2024)

Approximating Single-Source Personalized PageRank with Absolute Error Guarantees
par: Wei, Zhewei, et autres
Publié: (2024)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
par: Gadekar, Ameet, et autres
Publié: (2025)

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)

A Refined Kernel for $d$-Hitting Set
par: Liu, Yuxi, et autres
Publié: (2025)

Linear Kernels for $l$-Exact Component Order Connectivity
par: Liu, Yuxi, et autres
Publié: (2026)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
par: Tian, Kangyi, et autres
Publié: (2026)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
par: Bai, Tian, et autres
Publié: (2022)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
par: Xiong, Ziliang, et autres
Publié: (2024)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
par: Liu, Yuxi, et autres
Publié: (2024)

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

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
par: Blauth, Jannis, et autres
Publié: (2022)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
par: Brinkop, Hauke, et autres
Publié: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
par: Laenen, Steinar, et autres
Publié: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
par: Bandyapadhyay, Sayan, et autres
Publié: (2023)

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
par: Liu, Yuxi, et autres
Publié: (2026)