6 citations · 6 across the 7 of their papers we have counts for
3 papers · 2 filters
Approximating maximum integral multiflows on bounded genus graphs
Chien-chung Huang, Mathieu Mari, Claire Mathieu +1
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 t…
Ultimate greedy approximation of independent sets in subcubic graphs
Piotr Krysta, Mathieu Mari, Nan Zhi
We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization pro…
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
Chien-Chung Huang, Mathieu Mari, Claire Mathieu +2
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges form a planar…