A class of bounded approximation algorithms for graph partitioning
From MaRDI portal
Recommendations
Cites work
Cited in
(35)- Truthful Mechanisms for Matching and Clustering in an Ordinal World
- One-Half Approximation Algorithms for the k-Partition Problem
- Approximation algorithms for maximum dispersion
- scientific article; zbMATH DE number 1538871 (Why is no real title available?)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs
- On using learning automata for fast graph partitioning
- scientific article; zbMATH DE number 4011955 (Why is no real title available?)
- The balanced maximally diverse grouping problem with attribute values
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
- The balanced maximally diverse grouping problem with integer attribute values
- Approximation algorithms for fragmenting a graph against a stochastically-located threat
- Approximation Algorithms for Some Graph Partitioning Problems
- Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search
- scientific article; zbMATH DE number 3902687 (Why is no real title available?)
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
- Approximating the maximum quadratic assignment problem
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem
- Iterated maxima search for the maximally diverse grouping problem
- A black-box scatter search for optimization problems with integer variables
- NP-hardness of \(m\)-dimensional weighted matching problems
- Approximation algorithms for maximization problems arising in graph partitioning
- scientific article; zbMATH DE number 4076980 (Why is no real title available?)
- Efficient neighborhood evaluation for the maximally diverse grouping problem
- A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem
- scientific article; zbMATH DE number 2079358 (Why is no real title available?)
- Solution of large weighted equicut problems
- Tabu search for graph partitioning
- Generating irregular partitionable data structures
- A complementary column generation approach for the graph equipartition problem
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
- Balanced tree partition problems with virtual nodes
- Balanced partitions of trees and applications
This page was built for publication: A class of bounded approximation algorithms for graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474493)
