Skip to main content

2 Result(s)

within Article Remove this filter Mao-cheng Cai Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    Article

    Minimum k Arborescences with Bandwidth Constraints

    Let $G =(V,A)$ be a digraph with source $r$. A weight function $w$ and bandwidth constraint function $b$ (positive integer) on $A$ are given. We present algorithms for finding $k$ $r$-arborescences in $G$ wit...

    Mao-cheng Cai, **aotie Deng, Lusheng Wang in Algorithmica (2004)

  2. No Access

    Article

    Inverse Polymatroidal Flow Problem

    Let D = (V, A) be a directed graph, for each vertex v ∈ V, let Δ+(v) and Δ− (v) denote the sets of arcs leaving and entering v, $${\m...

    Mao-Cheng Cai, **aoguang Yang, Yanjun Li in Journal of Combinatorial Optimization (1999)