Pages that link to "Item:Q2768268"

The following pages link to Tree packing and approximating \(k\)-cuts (Q2768268):

Displaying 18 items.

• An approximate version of the tree packing conjecture (Q273108) (← links)
• Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← 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)
• Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
• Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
• LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533) (← links)
• (Q5077149) (← links)
• Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
• Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
• Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
• Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
• Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)
• A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)