scientific article; zbMATH DE number 6850487

zbMath1403.68350arXiv1710.08488MaRDI QIDQ4608074

Anupam Gupta, Euiwoong Lee, Jason Li

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1710.08488

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (16)

Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ On integer and bilevel formulations for the \(k\)-vertex cut problem ⋮ FPT approximation and subexponential algorithms for covering few or many edges ⋮ Maximizing coverage while ensuring fairness: a tale of conflicting objectives ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Constant-Factor FPT Approximation for Capacitated k-Median ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time ⋮ To close is easier than to open: dual parameterization to \(k\)-median

This page was built for publication: