Travelled to:1 × Canada
1 × Egypt
1 × France
1 × USA
Collaborated with:B.Laekhanukit D.Nanongkai S.Rao K.Talwar Z.Bar-Yossef A.C.Berg S.Chien D.Weitz
Talks about:approxim (3) algorithm (2) problem (2) metric (2) arbitrari (1) subgraph (1) connect (1) vertex (1) random (1) faster (1)
Person: Jittat Fakcharoenphol
DBLP: Fakcharoenphol:Jittat
Contributed to:
2010
20082003
2000Wrote 4 papers:
- ICALP-v1-2010-FakcharoenpholLN #algorithm #performance #problem
- Faster Algorithms for Semi-matching Problems (JF, BL, DN), pp. 176–187.
- STOC-2008-FakcharoenpholL #algorithm #approximate #problem
- An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.
- STOC-2003-FakcharoenpholRT #approximate #bound #metric
- A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.
- VLDB-2000-Bar-YossefBCFW #approximate #query #random #web
- Approximating Aggregate Queries about Web Pages via Random Walks (ZBY, ACB, SC, JF, DW), pp. 535–544.