New algorithms for a simple measure of network partitioning
From MaRDI portal
Publication:2700788
DOI10.1016/j.tcs.2023.113846OpenAlexW4361208981MaRDI QIDQ2700788
Publication date: 27 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113846
Cites Work
- Unnamed Item
- Algorithmic aspects of homophyly of networks
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Approximation and hardness results for the max \(k\)-uncut problem
- Finding happiness: an analysis of the maximum happy vertices problem
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
- Tackling the maximum happy vertices problem in large networks
- The maximum happy induced subgraph problem: bounds and algorithms
- Maximizing happiness in graphs of bounded clique-width
- On happy colorings, cuts, and structural parameterizations
- From the Cover: The structure of scientific collaboration networks
- Detecting high log-densities
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
- Structural Information and Dynamical Complexity of Networks
- Emergence of Scaling in Random Networks
- An approximation algorithm for maxk-uncut with capacity constraints
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- Approximation Algorithms for Graph Homomorphism Problems
- A Best Possible Heuristic for the k-Center Problem
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- Heuristic and Special Case Algorithms for Dispersion Problems
- Finding k Cuts within Twice the Optimal
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A simple min-cut algorithm
- Community structure in social and biological networks
- A local search approximation algorithm for k-means clustering
- Least squares quantization in PCM
- Applications of approximation algorithms to cooperative games
- A cost function for similarity-based hierarchical clustering
- Lower bounds for the happy coloring problems
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph
This page was built for publication: New algorithms for a simple measure of network partitioning
