Image de couverture de livre

NP-membership for the boundary-boundary art-gallery problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Stade, Jack
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Data Structures and Algorithms 68W40 F.2.2; I.1.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
par: Shigemizu, Mika, et autres
Publié: (2018)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

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

Experimental algorithms for the dualization problem
par: Mezzini, Mauro, et autres
Publié: (2025)

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

The Li-Chao Tree: Algorithm Specification and Analysis
par: Li, Chao
Publié: (2026)

A universal sequence of tensors for the asymptotic rank conjecture
par: Kaski, Petteri, et autres
Publié: (2024)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Naively Sorting Evolving Data is Optimal and Robust
par: Giakkoupis, George, et autres
Publié: (2024)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
par: Sølvsten, Steffan Christ, et autres
Publié: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

String 2-Covers with No Length Restrictions
par: Boneh, Itai, et autres
Publié: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

Hairpin Completion Distance Lower Bound
par: Boneh, Itai, et autres
Publié: (2024)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

Maximizing Diversity in (near-)Median String Selection
par: Chakraborty, Diptarka, et autres
Publié: (2026)

PPSZ is better than you think
par: Scheder, Dominik
Publié: (2022)

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

Symbolic Model Checking in External Memory
par: Sølvsten, Steffan Christ, et autres
Publié: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Efficient Binary Decision Diagram Manipulation in External Memory
par: Sølvsten, Steffan Christ, et autres
Publié: (2021)

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)

Strengths and Limitations of Greedy in Cup Games
par: Jasińska, Kalina, et autres
Publié: (2026)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
par: Shlyk, Vasiliy S.
Publié: (2026)

The Presort Hierarchy for Geometric Problems
par: van der Hoog, Ivor, et autres
Publié: (2026)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
par: Alpay, Faruk, et autres
Publié: (2026)

Deterministic Sparse FFT via Keyed Multi-View Gating with $O(\sqrt{N} \log k)$ Expected Time
par: Flouro, Aaron R., et autres
Publié: (2026)

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

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
par: Sølvsten, Steffan Christ, et autres
Publié: (2023)

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

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

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)

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

The Distributional Tail of Worst-Case Quickselect
par: Płecha, Witold
Publié: (2026)

Point Location in Constant Time
par: Chaganti, Sairam, et autres
Publié: (2023)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)