No label defined (Q5077149)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7528583

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7528583

Statements

scholarly article

0 references

0 references

Theory of Computing

0 references

publication date

18 May 2022

0 references

full work available at URL

https://arxiv.org/abs/1807.07143

0 references

zbMATH Keywords

\(k\)-cut

0 references

multiplicative weight updates

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

On the \(k\)-cut problem

0 references

0 references

Approximability of capacitated network design

0 references

The Steiner k-Cut Problem

0 references

Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems

0 references

On Approximating (Sparse) Covering Integer Programs

0 references

LP Relaxation and Tree Packing for Minimum $k$-Cut

0 references

Designing FPT Algorithms for Cut Problems Using Randomized Contractions

0 references

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

0 references

A General Approximation Technique for Constrained Forest Problems

0 references

0 references

Beyond the flow decomposition barrier

0 references

A Polynomial Algorithm for the k-cut Problem for Fixed k

0 references

0 references

The number of minimum <i>k</i> -cuts: improving the Karger-Stein bound

0 references

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

0 references

Fast Algorithms for Finding Nearest Common Ancestors

0 references

Local Flow Partitioning for Faster Edge Connectivity

0 references

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

0 references

Minimum cuts in near-linear time

0 references

A new approach to the minimum cut problem

0 references

The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable

0 references

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time

0 references

Approximation algorithms for covering/packing integer programs

0 references

0 references

Compact cactus representations of all non-trivial min-cuts

0 references

Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis

0 references

0 references

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

0 references

A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph

0 references

Minimum cost subpartitions in graphs

0 references

0 references

Edge-Disjoint Spanning Trees of Finite Graphs

0 references

Fast and Deterministic Approximations for k-Cut.

0 references

Graph expansion and the unique games conjecture

0 references

Approximating \(k\)-cuts using network strength as a Lagrangean relaxation

0 references

Finding <i>k</i> Cuts within Twice the Optimal

0 references

A data structure for dynamic trees

0 references

A simple min-cut algorithm

0 references

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

0 references

Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem

0 references

Identifiers

10.4086/toc.2022.v018a007

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5077149

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5077149&oldid=36805021"