Imagen de Portada

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Yong, Li, Shi, Liang, Zihao
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

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
por: Dai, Han, et al.
Publicado: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
por: Chen, Lin, et al.
Publicado: (2026)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
por: Zhao, Jingyang, et al.
Publicado: (2022)

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
por: Haviv, Ishay
Publicado: (2022)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
por: Zhao, Jingyang, et al.
Publicado: (2025)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

The Impact of Approximation on Algorithmic Progress
por: Li, Jeffery, et al.
Publicado: (2026)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
por: Albers, Susanne, et al.
Publicado: (2025)

Complexity and Algorithm for the Matching vertex-cutset Problem
por: Li, Hengzhe, et al.
Publicado: (2025)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
por: Tayal, Mumuksh
Publicado: (2025)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
por: Rui, Xiaobin, et al.
Publicado: (2025)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
por: Zhao, Jingyang, et al.
Publicado: (2026)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
por: Ning, Baoling, et al.
Publicado: (2024)

Faster Approximate Fixed Points of $\ell_\infty$-Contractions
por: Feodorov, Andrei, et al.
Publicado: (2026)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
por: Esmer, Barış Can, et al.
Publicado: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2025)

Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing
por: Lafond, Manuel
Publicado: (2024)

Improved Additive Approximation Algorithms for APSP
por: Jin, Ce, et al.
Publicado: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2025)

Approximation Algorithms for Steiner Connectivity Augmentation
por: Hathcock, Daniel, et al.
Publicado: (2023)

Approximation Algorithms for Digraph Width Parameters
por: Kintali, Shiva, et al.
Publicado: (2011)

Fast Algorithms for Graph Arboricity and Related Problems
por: Cen, Ruoxu, et al.
Publicado: (2025)

Query Complexity of the Metric Steiner Tree Problem
por: Chen, Yu, et al.
Publicado: (2022)

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
por: Habib, Ruhan, et al.
Publicado: (2025)

Polylogarithmic Approximation for Robust s-t Path
por: Li, Shi, et al.
Publicado: (2023)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
por: Chen, Xi, et al.
Publicado: (2026)

Optimal 4-Approximation for the Correlated Pandora's Problem
por: Bansal, Nikhil, et al.
Publicado: (2025)

New Approximation Guarantees for The Inventory Staggering Problem
por: Alon, Noga, et al.
Publicado: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
por: Neuwohner, Meike, et al.
Publicado: (2025)

Improved Approximations for Dial-a-Ride Problems
por: Zhao, Jingyang, et al.
Publicado: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
por: Antoniadis, Antonios, et al.
Publicado: (2020)

3/2-Approximation for the Forest Augmentation Problem
por: Çivril, Ali
Publicado: (2024)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)