Pages that link to "Item:Q4511245"
From MaRDI portal
The following pages link to Approximation Algorithms for Some Graph Partitioning Problems (Q4511245):
Displaying 26 items.
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- A linear time algorithm for graph partition problems (Q1198016) (← links)
- Approximation algorithms for the partial assignment problem (Q2197546) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations (Q3091376) (← links)
- Comparison of algorithms in graph partitioning (Q3163669) (← links)
- (Q3575418) (← links)
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (Q3580949) (← links)
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs (Q3638887) (← links)
- (Q3748301) (← links)
- (Q3807893) (← links)
- (Q3821604) (← links)
- (Q4471317) (← links)
- Approximation algorithms for array partitioning problems (Q4651813) (← links)
- Scalable Algorithms for Multiple Network Alignment (Q5009904) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← links)
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911) (← links)
- (Q5875482) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)