:: Library Catalog

Imatge de la portada

Guardat en:

Dades bibliogràfiques
Autors principals:	Kratsch, Stefan, Masařík, Tomáš, Muzi, Irene, Pilipczuk, Marcin, Sorge, Manuel
Format:	Preprint
Publicat:	2020
Matèries:	Data Structures and Algorithms Computational Geometry Discrete Mathematics 68Q25, 68W40, 68R01
Accés en línia:	https://arxiv.org/abs/2003.02475
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars

Shortest Paths in a Weighted Simplicial Complex
per: Chakraborty, Sukrit, et al.
Publicat: (2025)

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

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

Optimal Hardness of Online Algorithms for Large Independent Sets
per: Gamarnik, David, et al.
Publicat: (2025)

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

Fundamentals of Partial Rejection Sampling
per: Jerrum, Mark
Publicat: (2021)

On weighted graph separation problems and flow-augmentation
per: Kim, Eun Jung, et al.
Publicat: (2022)

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

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

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
per: Mundhra, S.
Publicat: (2025)

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

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

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

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

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

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
per: Meusel, Julia, et al.
Publicat: (2025)

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

Improved Approximation Algorithms for the Expanding Search Problem
per: Griesbach, Svenja M., et al.
Publicat: (2023)

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

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

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

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
per: López, Francisco, et al.
Publicat: (2023)

Interval Graphs are Reconstructible
per: Heinrich, Irene, et al.
Publicat: (2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
per: Buchbinder, Niv, et al.
Publicat: (2024)

Unbent Collections of Orthogonal Drawings
per: Antić, Todor, et al.
Publicat: (2025)

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

Untangling Graphs on Surfaces
per: de Verdière, Éric Colin, et al.
Publicat: (2023)

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

On sampling two spin models using the local connective constant
per: Efthymiou, Charilaos
Publicat: (2024)

Algorithms for Generating Small Random Samples
per: Cicirello, Vincent A.
Publicat: (2024)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
per: Mehiri, El-Mehdi
Publicat: (2025)

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

Incremental-Decremental Maximization
per: Disser, Yann, et al.
Publicat: (2025)

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

How to Compute a Moving Sum
per: Maslen, David K., et al.
Publicat: (2025)

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

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

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
per: Efthymiou, Charilaos
Publicat: (2020)

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

Sublinear-Time Computation in the Presence of Online Erasures
per: Kalemaj, Iden, et al.
Publicat: (2021)