Image de couverture de livre

Fine-Grained Complexity of Continuous Euclidean k-Center

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blank, Lotte, Bringmann, Karl, Chalermsook, Parinya, S., Karthik C., Kolbe, Benedikt, Le, Hung, van Wordragen, Geert
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry Computational Complexity Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On connections between k-coloring and Euclidean k-means
par: Aman, Enver, et autres
Publié: (2024)

Near-Optimal Bounds for Parameterized Euclidean k-means
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

The Fine-Grained Complexity of Episode Matching
par: Bille, Philip, et autres
Publié: (2021)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
par: Chia, Nai-Hui, et autres
Publié: (2026)

Fine-Grained Classification Of Detecting Dominating Patterns
par: Dransfeld, Jonathan, et autres
Publié: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
par: Bringmann, Karl, et autres
Publié: (2024)

Hardness of Median and Center in the Ulam Metric
par: Fischer, Nick, et autres
Publié: (2025)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
par: Rohwedder, Lars, et autres
Publié: (2024)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
par: Tate, Elise, et autres
Publié: (2025)

On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-Cut
par: Huang, Jeremy Ahrens, et autres
Publié: (2024)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

The Fine-Grained Complexity of Gradient Computation for Training Large Language Models
par: Alman, Josh, et autres
Publié: (2024)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

On the Hardness of Approximation of the Fair k-Center Problem
par: Thejaswi, Suhas
Publié: (2026)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2020)

Downward self-reducibility in the total function polynomial hierarchy
par: Gajulapalli, Karthik, et autres
Publié: (2025)

Online Orthogonal Vectors Revisited
par: Gajulapalli, Karthik, et autres
Publié: (2026)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
par: S., Karthik C., et autres
Publié: (2023)

k-SUM Hardness Implies Treewidth-SETH
par: Lampis, Michael
Publié: (2025)

Analyzing and Leveraging the $k$-Sensitivity of LZ77
par: Bathie, Gabriel, et autres
Publié: (2026)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
par: Mao, Songtao
Publié: (2026)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
par: Bringmann, Karl, et autres
Publié: (2023)

Fine-Grained Complexity of Regular Path Queries
par: Casel, Katrin, et autres
Publié: (2021)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
par: Doney, Kyle, et autres
Publié: (2025)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
par: Lee, Euiwoong, et autres
Publié: (2024)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

The Complexity of Finding and Counting Subtournaments
par: Döring, Simon, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

On the Complexity of Signed Roman Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

On the Space Complexity of Online Convolution
par: Andersson, Joel Daniel, et autres
Publié: (2025)