Approximation Algorithms for Some Graph Partitioning Problems
From MaRDI portal
Publication:4511245
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cited in
(36)- 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
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
- Fundamentals of Computation Theory
- A class of bounded approximation algorithms for graph partitioning
- On the sum-max graph partitioning problem
- Scalable algorithms for multiple network alignment
- scientific article; zbMATH DE number 4094840 (Why is no real title available?)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
- Generalized \(k\)-multiway cut problems
- Approximation algorithms for array partitioning problems
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- Finding a small number of colourful components
- On the clique partitioning problem in weighted interval graphs
- scientific article; zbMATH DE number 7650095 (Why is no real title available?)
- Approximation and hardness results for the maximum edges in transitive closure problem
- Comparison of algorithms in graph partitioning
- Some graph partitioning problems
- A linear time algorithm for graph partition problems
- On the approximability of the minimum weight \(t\)-partite clique problem
- Approximating element-weighted vertex deletion problems for the complete \(k\)-partite property
- Colourful components in \(k\)-caterpillars and planar graphs
- Approximation algorithms for the partial assignment problem
- Approximation algorithms for maximization problems arising in graph partitioning
- scientific article; zbMATH DE number 4076980 (Why is no real title available?)
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
- OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations
- scientific article; zbMATH DE number 2079358 (Why is no real title available?)
- Approximation algorithms for maximally balanced connected graph partition
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- scientific article; zbMATH DE number 5761786 (Why is no real title available?)
- On approximability of optimization problems related to red/blue-split graphs
- scientific article; zbMATH DE number 3983202 (Why is no real title available?)
This page was built for publication: Approximation Algorithms for Some Graph Partitioning Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511245)
