Pages that link to "Item:Q4326855"
From MaRDI portal
The following pages link to Finding <i>k</i> Cuts within Twice the Optimal (Q4326855):
Displaying 50 items.
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- An exact model for cell formation in group technology (Q373207) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions (Q1987237) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Algorithms for placing monitors in a flow network (Q2441585) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- Algorithms for Placing Monitors in a Flow Network (Q3638447) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- (Q5077149) (← links)
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911) (← links)
- (Q5111755) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- (Q5140849) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
