More on greedy construction heuristics for the MAX-CUT problem

• URL: http://arxiv.org/abs/2312.10895v1
• Date: Mon, 18 Dec 2023 02:52:04 GMT
• Title: More on greedy construction heuristics for the MAX-CUT problem
• Authors: Jianan Wang, Chuixiong Wu, Fen Zuo
• Abstract summary: We show that this picture helps to classify the main greedys for the maximum cut problem. All versions of the Sahni-Gonzalez(SG) algorithms could be classified as the Prim class. Various Edge-Contraction(EC) algorithms are of the Kruskal class.
• Score: 8.148355685823521
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics for the maximum cut problem, in analogy with the minimum spanning tree problem. Namely, all versions of the Sahni-Gonzalez~(SG) algorithms could be classified as the Prim class, while various Edge-Contraction~(EC) algorithms are of the Kruskal class. We further elucidate the relation of this framework to the stabilizer formalism in quantum computing, and point out that the recently proposed \textit{ADAPT-Clifford} algorithm is a reformulation of a refined version of the SG algorithm, SG3. Numerical performance of the typical algorithms from the two classes are studied with various kinds of graphs. It turns out that, the Prim-class algorithms perform better for general dense graphs, and the Kruskal-class algorithms performs better when the graphs are sparse enough.

Related papers

• A Greedy Strategy for Graph Cut [95.2841574410968]
  We propose a greedy strategy to solve the problem of Graph Cut, called GGC. It starts from the state where each data sample is regarded as a cluster and dynamically merges the two clusters. GGC has a nearly linear computational complexity with respect to the number of samples.
  arXiv  Detail & Related papers  (2024-12-28T05:49:42Z)
• Efficient Graph Matching for Correlated Stochastic Block Models [7.320365821066744]
  We study learning problems on correlated block models with two balanced communities. Our main result gives the first efficient algorithm for graph matching in this setting. We extend this to an efficient algorithm for exact graph matching whenever this is information-theoretically possible.
  arXiv  Detail & Related papers  (2024-12-03T18:36:45Z)
• Optimal spanning tree reconstruction in symbolic regression [2.553456266022125]
  A model is a superposition of primitive functions. The proposed algorithm reconstructs theminimum spanning tree from theweighted colored graph. This paper presents a novel solution based on the prize-collecting Steiner tree algorithm.
  arXiv  Detail & Related papers  (2024-06-25T13:22:13Z)
• Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better [18.121514220195607]
  Cluster deletion is an NP-hard graph clustering objective with applications in computational and social network analysis. We first provide a tighter analysis of two previous approximation algorithms, improving their approximation guarantees from 4 to 3. We show that both algorithms can be derandomized in a surprisingly simple way, by greedily taking a maximum degree in an auxiliary graph and forming a cluster around it.
  arXiv  Detail & Related papers  (2024-04-24T18:39:18Z)
• A Differentially Private Clustering Algorithm for Well-Clustered Graphs [6.523602840064548]
  We provide an efficient ($epsilon,$delta$)-DP algorithm tailored specifically for such graphs. Our algorithm works for well-clustered graphs with $k$ nearly-balanced clusters.
  arXiv  Detail & Related papers  (2024-03-21T11:57:16Z)
• Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages [104.90415092306219]
  Four formalisms are equivalent to tree-adjoining grammars (TAG), linear indexed grammars (LIG), pushdown-adjoining automata (PAA) and embedded pushdown automata (EPDA) We design new algorithms for computing their stringsum derivations (the weight of all automatons of a string) and allsums (the weight of all derivations) For EPDA, our algorithm is both more space-efficient and time-efficient than the algorithm of Alonso et al. (2001) by factors of $mathcalO(|Gamma|2)$ and $
  arXiv  Detail & Related papers  (2023-10-23T18:26:00Z)
• Quantitative approach to Grover's quantum walk on graphs [62.997667081978825]
  We study Grover's search algorithm focusing on continuous-time quantum walk on graphs. Instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph endowed Laplacians.
  arXiv  Detail & Related papers  (2022-07-04T19:33:06Z)
• Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice [17.801124377461953]
  We study whether Karger's algorithm can be successfully generalized to other cut problems. We present a simple new algorithm for seeded segmentation / graph-based semi-supervised learning. The new algorithm has linear runtime and yields a potential that can be interpreted as the posterior probability of a sample belonging to a given seed / class.
  arXiv  Detail & Related papers  (2021-10-05T07:46:28Z)
• Hybrid quantum-classical algorithms for approximate graph coloring [65.62256987706128]
  We show how to apply the quantum approximate optimization algorithm (RQAOA) to MAX-$k$-CUT, the problem of finding an approximate $k$-vertex coloring of a graph. We construct an efficient classical simulation algorithm which simulates level-$1$ QAOA and level-$1$ RQAOA for arbitrary graphs.
  arXiv  Detail & Related papers  (2020-11-26T18:22:21Z)
• Efficient Computation of Expectations under Spanning Tree Distributions [67.71280539312536]
  We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms.
  arXiv  Detail & Related papers  (2020-08-29T14:58:26Z)
• Online Dense Subgraph Discovery via Blurred-Graph Feedback [87.9850024070244]
  We introduce a novel learning problem for dense subgraph discovery. We first propose a edge-time algorithm that obtains a nearly-optimal solution with high probability. We then design a more scalable algorithm with a theoretical guarantee.
  arXiv  Detail & Related papers  (2020-06-24T11:37:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.