 | 2012 |
|---|
| 9 |       | Joseph Cheriyan,
Bundit Laekhanukit,
Guyslain Naves,
Adrian Vetta:
Approximating rooted Steiner networks.
SODA 2012: 1499-1511 |
| 8 | | Bundit Laekhanukit,
Shayan Oveis Gharan,
Mohit Singh:
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
CoRR abs/1205.1262: (2012) |
| 2011 |
|---|
| 7 | | Bundit Laekhanukit:
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity - (Extended Abstract).
ICALP (1) 2011: 13-24 |
| 6 | | Bundit Laekhanukit:
An improved approximation algorithm for the minimum-cost subset k-connected subgraph problem
CoRR abs/1104.3923: (2011) |
| 2010 |
|---|
| 5 | | Jittat Fakcharoenphol,
Bundit Laekhanukit,
Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract).
ICALP (1) 2010: 176-187 |
| 4 | | Patrick Briest,
Parinya Chalermsook,
Sanjeev Khanna,
Bundit Laekhanukit,
Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
WINE 2010: 444-454 |
| 3 | | Jittat Fakcharoenphol,
Bundit Laekhanukit,
Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems
CoRR abs/1004.3363: (2010) |
| 2009 |
|---|
| 2 | | Parinya Chalermsook,
Bundit Laekhanukit,
Danupon Nanongkai:
Stackelberg Pricing is Hard to Approximate within $2-\epsilon$
CoRR abs/0910.0443: (2009) |
| 2008 |
|---|
| 1 | | Jittat Fakcharoenphol,
Bundit Laekhanukit:
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.
STOC 2008: 153-158 |
Data released under the ODC-BY 1.0 license — See also our legal information page