scientific article
From MaRDI portal
Publication:2768268
zbMath0987.05089MaRDI QIDQ2768268
Yuval Rabani, Joseph (Seffi) Naor
Publication date: 30 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis ⋮ Minimum cost subpartitions in graphs ⋮ Approximation algorithms for requirement cut on graphs ⋮ Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Approximating \(k\)-cuts using network strength as a Lagrangean relaxation ⋮ Approximating Requirement Cut via a Configuration LP ⋮ Unnamed Item
This page was built for publication:
