Copertina

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Yong, Li, Shi, Liang, Zihao
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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