Improved Approximation Algorithms for the Expanding Search Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Griesbach, Svenja M., Hommelsheim, Felix, Klimm, Max, Schewior, Kevin
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms 68W25, 68R12
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
di: Hommelsheim, Felix
Pubblicazione: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
di: Friggstad, Zachary, et al.
Pubblicazione: (2018)

A $5/4$-Approximation for Two-Edge Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2024)

The Telephone $k$-Multicast Problem
di: Hathcock, Daniel, et al.
Pubblicazione: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
di: Bai, Miao, et al.
Pubblicazione: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
di: Simmons, Miles, et al.
Pubblicazione: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
di: Newman, Ilan, et al.
Pubblicazione: (2021)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
di: Grobben, Kobe, et al.
Pubblicazione: (2025)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
di: Bansal, Ishan, et al.
Pubblicazione: (2024)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
di: Andreou, Pantelis, et al.
Pubblicazione: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
di: Bubeck, Sébastien, et al.
Pubblicazione: (2022)

A scalable clustering algorithm to approximate graph cuts
di: Suchan, Leo, et al.
Pubblicazione: (2023)

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
di: Simmons, Miles, et al.
Pubblicazione: (2026)

Random-Order Online Independent Set of Intervals and Hyperrectangles
di: Garg, Mohit, et al.
Pubblicazione: (2024)

Optimal Discretization is Fixed-parameter Tractable
di: Kratsch, Stefan, et al.
Pubblicazione: (2020)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

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

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
di: Gupta, Swati, et al.
Pubblicazione: (2022)

A $4/3$ Approximation for $2$-Vertex-Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2023)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
di: Rahat, Md Tanzeem, et al.
Pubblicazione: (2025)

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

Quasi-optimal hierarchically semi-separable matrix approximation
di: Amsel, Noah, et al.
Pubblicazione: (2025)

Building a Nest by an Automaton
di: Czyzowicz, Jurek, et al.
Pubblicazione: (2019)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
di: Liu, Bowen
Pubblicazione: (2025)

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

Algorithms Transcending the SAT-Symmetry Interface
di: Anders, Markus, et al.
Pubblicazione: (2023)

Optimal Online Bipartite Matching in Degree-2 Graphs
di: Bhangale, Amey, et al.
Pubblicazione: (2025)

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

Competitive Data-Structure Dynamization
di: Mathieu, Claire, et al.
Pubblicazione: (2020)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
di: Nasre, Meghana, et al.
Pubblicazione: (2023)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
di: Gupta, Swati, et al.
Pubblicazione: (2023)

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

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
di: Filmus, Yuval, et al.
Pubblicazione: (2024)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
di: Gupta, Swati, et al.
Pubblicazione: (2025)

Stochastic Function Certification with Correlations
di: Ghuge, Rohan, et al.
Pubblicazione: (2026)

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

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
di: Sun, Hao
Pubblicazione: (2023)

Experimental algorithms for the dualization problem
di: Mezzini, Mauro, et al.
Pubblicazione: (2025)