Cover Image

A Euclidean Distance Matrix Model for Convex Clustering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Zhaowei, Liu, Xiaowen, Li, Qingna
Format:	Preprint
Published:	2021
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Elimination Distance to Dominated Clusters
by: Schirrmacher, Nicole, et al.
Published: (2025)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
by: Fomin, Fedor V., et al.
Published: (2026)

Multipacking on graphs and Euclidean metric space
by: Islam, Sk Samim
Published: (2026)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
by: Bentert, Matthias, et al.
Published: (2025)

The Harmonic Indel Distance
by: Pepin, Bob
Published: (2020)

Concepts of Dimension for Convex Geometries
by: Knauer, Kolja, et al.
Published: (2023)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

Finding Minimal Clusters in st-DAGs
by: Vogl, Ulrich, et al.
Published: (2026)

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
by: Baumann, Philipp, et al.
Published: (2026)

Digraph Branchings and Matrix Determinants
by: Ghosh, Sayani, et al.
Published: (2023)

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
by: Elbassioni, Khaled
Published: (2024)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
by: Galanis, Andreas, et al.
Published: (2026)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

A Distance Amplification Lemma for Monotonicity
by: Minzer, Dor
Published: (2025)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Distance Recoloring
by: Banerjee, Niranka, et al.
Published: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
by: Ashok, Pradeesha, et al.
Published: (2024)

Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
by: Alkhouri, Ismail, et al.
Published: (2025)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
by: Dorfer, Joseph
Published: (2026)

Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
by: Dabah, Adel
Published: (2026)

The EnvDesign Model: A Method to Solve the Environment Design Problem
by: Sathiya, Akshay, et al.
Published: (2024)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball
by: Bourgeais, Quentin, et al.
Published: (2024)

Holes in Convex and Simple Drawings
by: Bergold, Helena, et al.
Published: (2024)

Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)

Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time
by: Wang, Adam
Published: (2025)

Graph Theoretic Investigations on Inefficiencies in Network Models
by: Cenciarelli, Pietro, et al.
Published: (2016)

Designing ReLU Generative Networks to Enumerate Trees with a Given Tree Edit Distance
by: Ghafoor, Mamoona, et al.
Published: (2025)

First-Fit Coloring of Forests in Random Arrival Model
by: Bosek, Bartłomiej, et al.
Published: (2024)

Partial Optimality in Cubic Correlation Clustering for General Graphs
by: Stein, David, et al.
Published: (2025)

(Approximate) Matrix Multiplication via Convolutions
by: Uffenheimer, Yahel, et al.
Published: (2025)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
by: Tu, Ziran, et al.
Published: (2024)

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)

Modeling energy collection with shortest paths in rectangular grids: an efficient algorithm for energy harvesting
by: Díaz-Bañez, José-Miguel, et al.
Published: (2025)

Broadcast Graph Is NP-complete
by: Xu, Jinghan, et al.
Published: (2024)

The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025)