MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Jittat Fakcharoenphol" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

subgraph
by Jittat Fakcharoenphol, Bundit Laekhanukit — 2007
…An O(log 2 k)-approximation algorithm for the k-vertex connected subgraph problem Jittat…
Add To MetaCart

A Running Time Analysis for an Ant Colony Optimization Algorithm for Shortest Paths on Directed Acyclic Graphs
by Nattapat Attiratanasunthron, Jittat Fakcharoenphol
… Acyclic Graphs Nattapat Attiratanasunthron Jittat Fakcharoenphol Department of Computer Engineering…
Cited by 1 (0 self) – Add To MetaCart

Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
by Jittat Fakcharoenphol, Satish Rao — 2001 — In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science
…Planar graphs, negative weight edges, shortest paths, and near linear time Jittat Fakcharoenphol…
Cited by 31 (0 self) – Add To MetaCart

An improved decomposition theorem for graphs excluding a fixed minor
by Jittat Fakcharoenphol, Kunal Talwar — 2003 — In Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization
… An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor Jittat Fakcharoenphol1…
Cited by 7 (0 self) – Add To MetaCart

A faster algorithm for finding optimal semi-matching
by Jittat Fakcharoenphol, Bundit Lekhanukit, Danupon Nanongkai — 2007
…A faster algorithm for finding optimal semi-matching Jittat Fakcharoenphol Bundit Lekhanukit…
Add To MetaCart

SMILE: Towards the Affordable High-Performance Computing Platform using Network-Based Multicomputer
by Putchong Uthayopas, Supaket Katchmart, Jittat Fakcharoenphol, Panit Hemunnopjit — 1997 — Proceedings of the First National Computational Science and Engineering Symposium
… Putchong Uthayopas, Supaket Katchmart, Jittat Fakcharoenphol, Panit Hemunnopjit Computer and Network System…
Cited by 2 (0 self) – Add To MetaCart

The k-Traveling Repairman Problem
by Jittat Fakcharoenphol, Chris Harrelson, Satish Rao — 2003 — Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms
…The k-Traveling Repairman Problem Jittat Fakcharoenphol # Chris Harrelson + Satish Rao # Abstract…
Cited by 18 (1 self) – Add To MetaCart

An improved approximation algorithm for the 0-extension problem
by Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar — 2003 — In 14th Annual ACMSIAM Symposium on Discrete Algorithms
… An improved approximation algorithm for the 0-extension problem Jittat Fakcharoenphol * Chris…
Cited by 14 (2 self) – Add To MetaCart

A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics
by Jittat Fakcharoenphol, Satish Rao, Kunal Talwar — 2003 — In Proceedings of the 35th Annual ACM Symposium on Theory of Computing
…A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics Jittat Fakcharoenphol # Computer…
Cited by 149 (3 self) – Add To MetaCart

Approximate Classification via Earthmover Metrics
by Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos — 2004 — In SODA ’04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
…Approximate classification via earthmover metrics Aaron Archer ∗ Jittat Fakcharoenphol † Chris…
Cited by 10 (1 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB