Searching for authors named "Lap Chi Lau" – sorted by Relevance.
-
Submodular Functions in Combinatorial Optimization
- Submodular Functions in Combinatorial Optimization Lap Chi Lau 1 Introduction The following
- Add To MetaCart
-
ABSTRACT Additive Approximation for Bounded Degree Survivable Network Design
- ABSTRACT Additive Approximation for Bounded Degree Survivable Network Design Lap Chi Lau ∗ CSE
- Add To MetaCart
-
An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- MAX-STEINER-TREE-PACKING MIN-STEINER-CUT THEOREM* LAP CHI LAU † Received April 6, 2004 Given
- Cited by 11 (1 self) – Add To MetaCart
-
On approximate min-max theorems of graph connectivity problems
- On Approximate Min-Max Theorems for Graph Connectivity Problems by Lap Chi Lau A thesis
- Cited by 1 (0 self) – Add To MetaCart
-
Bipartite roots of graphs
- Bipartite Roots of Graphs LAP CHI LAU University of Toronto Abstract. Graph H is a root of graph G
- Cited by 6 (0 self) – Add To MetaCart
-
Randomly colouring graphs with girth five and large maximum degree
- Randomly Colouring Graphs with Girth Five and Large Maximum Degree Lap Chi Lau and Michael Molloy
- Cited by 2 (0 self) – Add To MetaCart
-
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
- Tepper School of BusinessCarnegie Mellon University Pittsburgh, PA USAmohits@(email omitted); Lap Chi Lau
- Cited by 9 (3 self) – Add To MetaCart
-
A note on degree-constrained subgraphs
- A note on degree-constrained subgraphs András Frank ∗ , Lap Chi Lau † , Jácint Szabó ∗ April 21
- Add To MetaCart
-
On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies
- . Their email addresses are {arcane,bli,djiang}@(email omitted);}. Lap Chi Lau is with the Department
- Cited by 6 (2 self) – Add To MetaCart
-
Degree Bounded Matroids and Submodular Flows
- Degree Bounded Matroids and Submodular Flows Tamás Király 1⋆ , Lap Chi Lau 2 , and Mohit Singh 3
- Cited by 1 (1 self) – Add To MetaCart

