scientific article; zbMATH DE number 2119718
From MaRDI portal
Publication:4828991
zbMath1094.68616MaRDI QIDQ4828991
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (10)
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 ⋮ Parameterized algorithms for min-max multiway cut and list digraph homomorphism ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem ⋮ New algorithms for a simple measure of network partitioning ⋮ Approximating \(k\)-cuts using network strength as a Lagrangean relaxation ⋮ Approximating Requirement Cut via a Configuration LP ⋮ Dynamic evolution of economically preferred facilities
This page was built for publication:
