Approximating maximum integral multiflows on bounded genus graphs

05/01/2020
by   Chien-Chung Huang, et al.
0

We devise the first constant-factor approximation algorithm for finding an integral multi-commodity flow of maximum total value for instances where the supply graph together with the demand edges can be embedded on an orientable surface of bounded genus. This extends recent results for planar instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2020

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

We devise a constant-factor approximation algorithm for the maximization...
research
07/28/2020

Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow

Given an edge weighted graph and a forest F, the 2-edge connectivity aug...
research
05/31/2021

A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut

The (non-uniform) sparsest cut problem is the following graph-partitioni...
research
07/01/2022

Packing cycles in planar and bounded-genus graphs

We devise constant-factor approximation algorithms for finding as many d...
research
11/23/2020

An Estimator for Matching Size in Low Arboricity Graphs with Two Applications

In this paper, we present a new simple degree-based estimator for the si...
research
11/11/2021

A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time

In the non-uniform sparsest cut problem, we are given a supply graph G a...
research
07/21/2020

Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators

Since 2000 there has been a steady stream of advances for the maximum we...

Please sign up or login with your details

Forgot password? Click here to reset