Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Jittat
Last name:	Fakcharoenphol
DBLP:	63/319
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 20 of 20  

Select a publication
Show	Title	Venue	Rating	Date
	Jittat Fakcharoenphol, Boonserm Kijsirikul. Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.	Algorithmic Learning Theory, 19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008. Proceedings 2008	(0)	2008
	Jittat Fakcharoenphol, Bundit Laekhanukit. An o(log	Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008	(0)	2008
	Jittat Fakcharoenphol, Boonserm Kijsirikul. Low congestion online routing and an improved mistake bound for online prediction of graph labeling	CoRR 2008, Volume 0	(0)	2008
	Nattapat Attiratanasunthron, Jittat Fakcharoenphol. A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs.	Inf. Process. Lett. 2008, Volume 105	(0)	2008
	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar. Approximating Metric Spaces by Tree Metrics.	Encyclopedia of Algorithms 2008	(0)	2008
	Jittat Fakcharoenphol, Satish Rao. Shortest Paths in Planar Graphs with Negative Weight Edges.	Encyclopedia of Algorithms 2008	(0)	2008
	Jittat Fakcharoenphol, Chris Harrelson, Satish Rao. The	ACM Transactions on Algorithms 2007, Volume 3	(0)	2007
	Jittat Fakcharoenphol, Satish Rao. Planar graphs, negative weight edges, shortest paths, and near linear time.	J. Comput. Syst. Sci. 2006, Volume 72	(0)	2006
	Jittat Fakcharoenphol, Boonserm Kijsirikul. Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.	Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings 2005	(0)	2005
	Parinya Chalermsook, Jittat Fakcharoenphol. Simple Distributed Algorithms for Approximating Minimum Steiner Trees.	Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings 2005	(0)	2005
	Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos. Approximate classification via earthmover metrics.	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004	(0)	2004
	Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004	(0)	2004
	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics.	J. Comput. Syst. Sci. 2004, Volume 69	(0)	2004
	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar. Approximating metrics by tree metrics.	SIGACT News 2004, Volume 35	(0)	2004
	Jittat Fakcharoenphol, Kunal Talwar. An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.	Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx 2003	(0)	2003
	Jittat Fakcharoenphol, Chris Harrelson, Satish Rao. The k-traveling repairman problem.	SODA 2003	(0)	2003
	Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar. An improved approximation algorithm for the 0-extension problem.	SODA 2003	(0)	2003
	Jittat Fakcharoenphol, Satish Rao, Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics.	Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003	(0)	2003
	Jittat Fakcharoenphol, Satish Rao. Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time.	FOCS 2001	(0)	2001
	Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz. Approximating Aggregate Queries about Web Pages via Random Walks.	VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt 2000	(0)	2000

Your query returned 20 matches in the database.