Cheng E.

E. Cheng

Information about the author E. Cheng will soon be added to the site.
Found 4 papers in total
Antiweb-wheel inequalities and their separation problems over the stable set polytopes
Antiweb-wheel inequalities and their separation problems over the stable set polytopes
2002
A stable set in a graph G is a set of pairwise nonadjacent vertices. The problem of...
Separating subdivision of bicycle wheel inequalities over cut polytopes
Separating subdivision of bicycle wheel inequalities over cut polytopes
1998
In this paper, we give a separation algorithm for a class of valid inequalities for...
Edge-augmentation of hypergraphs
Edge-augmentation of hypergraphs
1999
Let G be a connected hypergraph. We give a min–max relation for the minimum...
Successive edge-connectivity augmentation problems
Successive edge-connectivity augmentation problems
1999
It was known that for undirected edge-connectivity (and for uniform demands) the...
Papers per page: