Copertina

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Foos, Josefine, Held, Stephan, Spitzley, Yannik Kyle Dustin
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms 90C27, 68W25, 68M10 G.2.1; G.2.2; F.2.2; B.7.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

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

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

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

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Searching in trees with monotonic query times
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

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

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

Fairness in the k-Server Problem
di: Daneshvaramoli, Mohammadreza, et al.
Pubblicazione: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
di: Komusiewicz, Christian, et al.
Pubblicazione: (2023)

The Power of Filling in Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2022)

Mean-Biased Processes for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

Naively Sorting Evolving Data is Optimal and Robust
di: Giakkoupis, George, et al.
Pubblicazione: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
di: Chen, Yijia, et al.
Pubblicazione: (2023)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

Pliability and Approximating Max-CSPs
di: Romero, Miguel, et al.
Pubblicazione: (2019)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
di: Krishnaswamy, Ravishankar, et al.
Pubblicazione: (2014)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Exact Algorithms for MaxCut on Split Graphs
di: Lalovic, Marko
Pubblicazione: (2024)

Hairpin Completion Distance Lower Bound
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
di: An, Hyung-Chan, et al.
Pubblicazione: (2025)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
di: Crochemore, Maxime, et al.
Pubblicazione: (2025)

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

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
di: Gabryelski, Wojciech, et al.
Pubblicazione: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
di: Fang, Xiaolei, et al.
Pubblicazione: (2026)

A Constant-factor Approximation for Weighted Bond Cover
di: Kim, Eun Jung, et al.
Pubblicazione: (2021)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
di: Alimi, Morteza, et al.
Pubblicazione: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
di: Szyfelbein, Michał
Pubblicazione: (2025)

Bicriteria Submodular Maximization
di: Feldman, Moran, et al.
Pubblicazione: (2025)

On the twin-width of near-regular graphs
di: Heinrich, Irene, et al.
Pubblicazione: (2025)