Copertina

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Davies, Sami, Moseley, Benjamin, Newman, Heather
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Discrete Mathematics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
di: Davies, Sami, et al.
Pubblicazione: (2023)

A Tale of Santa Claus, Hypergraphs and Matroids
di: Davies, Sami, et al.
Pubblicazione: (2018)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
di: Crane, Alex, et al.
Pubblicazione: (2025)

Worst-case Error Bounds for Online Learning of Smooth Functions
di: Xie, Weian
Pubblicazione: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
di: Veldt, Nate, et al.
Pubblicazione: (2025)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
di: Aouad, Ali, et al.
Pubblicazione: (2022)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
di: Veldt, Nate
Pubblicazione: (2025)

Simultaneous Drawing of Layered Trees
di: Katheder, Julia, et al.
Pubblicazione: (2023)

Exact Causal Attention with 10% Fewer Operations
di: Rybin, Dmitry, et al.
Pubblicazione: (2025)

Graph Inference with Effective Resistance Queries
di: Bennett, Huck, et al.
Pubblicazione: (2025)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
di: He, Xi
Pubblicazione: (2025)

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
di: Sharman, Bharat, et al.
Pubblicazione: (2025)

Optimal hypersurface decision trees
di: He, Xi
Pubblicazione: (2025)

Partial Optimality in the Preordering Problem
di: Stein, David, et al.
Pubblicazione: (2026)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
di: Tukan, Murad, et al.
Pubblicazione: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
di: Chen, Yixin, et al.
Pubblicazione: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
di: Velilla, Eduar Castrillo
Pubblicazione: (2026)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
di: Xue, Jinghui, et al.
Pubblicazione: (2024)

A 4-approximation algorithm for min max correlation clustering
di: Heidrich, Holger, et al.
Pubblicazione: (2023)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
di: Dutta, Kunal, et al.
Pubblicazione: (2026)

The Role of Dimension in the Online Chasing Problem
di: Papazov, Hristo
Pubblicazione: (2023)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
di: Wang, Chen, et al.
Pubblicazione: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
di: Deák, Bence, et al.
Pubblicazione: (2026)

Online Graph Coloring for $k$-Colorable Graphs
di: Kawarabayashi, Ken-ichi, et al.
Pubblicazione: (2025)

Online Graph Balancing and the Power of Two Choices
di: Bansal, Nikhil, et al.
Pubblicazione: (2026)

All ascents exponential from valued constraint graphs of pathwidth three
di: Kaznatcheev, Artem, et al.
Pubblicazione: (2026)

Improved Streaming Algorithm for Fair $k$-Center Clustering
di: Guo, Longkun, et al.
Pubblicazione: (2025)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
di: Madathil, Jayakrishnan, et al.
Pubblicazione: (2024)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
di: Antony, Dhanyamol, et al.
Pubblicazione: (2023)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
di: Harada, Tsubasa, et al.
Pubblicazione: (2024)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
di: Kaymakov, Kirill V., et al.
Pubblicazione: (2024)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
di: Liao, Meihao, et al.
Pubblicazione: (2025)

Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
di: Zhang, Bohang, et al.
Pubblicazione: (2024)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
di: Gaikwad, Ajinkya
Pubblicazione: (2025)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
di: Harada, Tsubasa
Pubblicazione: (2024)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
di: Li, Zihao, et al.
Pubblicazione: (2024)

Maximum $k$- vs. $\ell$-colourings of graphs
di: Nakajima, Tamio-Vesa, et al.
Pubblicazione: (2023)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
di: Mota, Felipe O., et al.
Pubblicazione: (2025)

Coresets for Multiple $\ell_p$ Regression
di: Woodruff, David P., et al.
Pubblicazione: (2024)

Efficient algorithms for the Potts model on small-set expanders
di: Carlson, Charles, et al.
Pubblicazione: (2020)