Image de couverture de livre

A scalable clustering algorithm to approximate graph cuts

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Suchan, Leo, Li, Housen, Munk, Axel
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Discrete Mathematics 68W25 (Primary), 68R10 (Secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
par: Meusel, Julia, et autres
Publié: (2025)

Fundamentals of Partial Rejection Sampling
par: Jerrum, Mark
Publié: (2021)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Optimal Discretization is Fixed-parameter Tractable
par: Kratsch, Stefan, et autres
Publié: (2020)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

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

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Cops and Robbers on Multi-Layer Graphs
par: Enright, Jessica, et autres
Publié: (2023)

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

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
par: Buchbinder, Niv, et autres
Publié: (2024)

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

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Shortest Paths in a Weighted Simplicial Complex
par: Chakraborty, Sukrit, et autres
Publié: (2025)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
par: Munaro, Andrea, et autres
Publié: (2022)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

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

APTAS for bin packing with general cost structures
par: Jaykrishnan, G., et autres
Publié: (2024)

On sampling two spin models using the local connective constant
par: Efthymiou, Charilaos
Publié: (2024)

Young domination on Hamming rectangles
par: Gravner, Janko, et autres
Publié: (2025)

Optimal Hardness of Online Algorithms for Large Independent Sets
par: Gamarnik, David, et autres
Publié: (2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
par: Feldman, Moran, et autres
Publié: (2025)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
par: Mühlenthaler, Moritz, et autres
Publié: (2024)

Dorst-Smeulders Coding for Arbitrary Binary Words
par: De Luca, Alessandro, et autres
Publié: (2025)

An Algorithm to Recover Shredded Random Matrices
par: Atamanchuk, Caelan, et autres
Publié: (2023)

Degree Realization by Bipartite Cactus Graphs
par: Bar-Noy, Amotz, et autres
Publié: (2025)

Unbent Collections of Orthogonal Drawings
par: Antić, Todor, et autres
Publié: (2025)

On the thinness of trees
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

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

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
par: Efthymiou, Charilaos
Publié: (2020)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)

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

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

Algorithms for the ferromagnetic Potts model on expanders
par: Carlson, Charlie, et autres
Publié: (2022)