Image de couverture de livre

Approximation algorithms for the prize-collecting rural postman problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Hong, Li, Jianping, Li, Wei, Xie, Runtao, Yang, Xiaoxiao
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms 68W25, 90C27, 90C35 F.2.2; G.2.2; G.1.6
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
par: Li, Shisheng
Publié: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
par: Foos, Josefine, et autres
Publié: (2023)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
par: Rockel-Wolff, Benjamin
Publié: (2024)

An improved approximation algorithm for k-Median
par: Young, Neal E.
Publié: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

Modern column generation for estimating single- and multi-purchase ranked list choice models
par: Costa, Luciano, et autres
Publié: (2026)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)

Polyhedral approach to weighted connected matchings in general graphs
par: Samer, Phillippe, et autres
Publié: (2023)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
par: Fang, Xiaolei, et autres
Publié: (2026)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
par: Cheng, Cong-Dian
Publié: (2017)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
par: Laekhanukit, Bundit
Publié: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
par: Circelli, Michele
Publié: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
par: Bui, Quang Minh, et autres
Publié: (2022)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
par: Alimi, Morteza, et autres
Publié: (2025)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
par: Chimani, Markus, et autres
Publié: (2021)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Loop unrolling of UCA models: distance labeling
par: Soulignac, Francisco J, et autres
Publié: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
par: Huber, Michael Kiran
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
par: Warme, David M.
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
par: Warme, David M.
Publié: (2024)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
par: Bansal, Ishan, et autres
Publié: (2024)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
par: Neira, David E. Bernal, et autres
Publié: (2021)