|
| Education |
|---|
- B.Eng (Computer Engineering)
Kasetsart University, Bangkok, Thailand
- M.Eng (Computer Engineering)
Kasetsart University, Bangkok, Thailand
(under supervision of J. Fakcharoenphol)
M.Eng Thesis:
Faster algorithms for optimal semi-matching problems.
(originally written in Thai, conference version
in ICALP 2010).
- M.Math (Combinatorics and Optimization)
University of Waterloo, Waterloo ON, Canada
(under supervision of J. Cheriyan)
M.Math Thesis:
Approximation algorithms for (S,T)-connectivity problems.
|
|
| Publications |
|---|
-
A Rounding by sampling approach to the minimum size k-arc
connected subgraph problem,
B. Laekhanukit, S. Oveis Gharan and M. Singh
ICALP 2012, to appear.
-
Approximating rooted Steiner networks,
J. Cheriyan, B. Laekhanukit, G. Naves and A. Vetta
SODA 2012.
-
An improved approximation algorithm for minimum-cost subset
k-connectivity,
B. Laekhanukit,
ICALP 2011.
-
Approximation algorithms for minimum cost k-(S,T) connected
digraphs,
J. Cheriyan and B. Laekhanukit,
submitted.
(preliminary version in
M.Math Thesis)
-
A bad example for the iterative rounding method for mincost
k-connected spanning subgraphs,
A. Aazami, J. Cheriyan and B. Laekhanukit,
submitted.
-
Improved hardness of approximation for Stackelberg shortest-path
pricing,
P. Briest, P. Chalermsook, S.Khanna, B. Laekhanukit
and D. Nanongkai,
WINE 2010 (short paper).
(Preliminary versions in
[arXiv]
and
[arXiv])
-
Faster algorithms for semi-matching problems,
J. Fakcharoenphol, B. Laekhanukit and D. Nanongkai,
ICALP 2010.
(Preliminary versions in
[arXiv])
-
An O(log2 k)-approximation algorithm for the k-vertex
connected spanning subgraph problem,
J. Fakcharoenphol and B. Laekhanukit,
STOC 2008.
| Publications in National Conference in Thailand |
|---|
|
|
|
|
|
