Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Fakcharoenphol, Jittat"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
Jakarin Chawachat
,
Jittat Fakcharoenphol
,
Wattana Jindaluang
Information Processing Letters
112
(24), 2012, pp. 937-941
An
O(\log^2k)
-approximation algorithm for the
k
-vertex connected spanning subgraph problem
Jittat Fakcharoenphol
,
Bundit Laekhanukit
SIAM Journal on Computing
41
(5), 2012, pp. 1095-1109
Short proofs for online multiclass prediction on graphs
Jittat Fakcharoenphol
,
Boonserm Kijsirikul
Information Processing Letters
110
(8-9), 2010, pp. 309-311
Faster algorithms for semi-matching problems
Jittat Fakcharoenphol
,
Bundit Laekhanukit
,
Danupon Nanongkai
Lecture Notes in Computer Science
6198
, 2010, pp. 176-187
An
O(\log^2 k)
-approximation algorithm for the
k
-vertex connected spanning subgraph problem
Jittat Fakcharoenphol
,
Bundit Laekhanukit
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 153-158
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
Nattapat Attiratanasunthron
,
Jittat Fakcharoenphol
Information Processing Letters
105
(3), 2007, pp. 88-92
Planar graphs, negative weight edges, shortest paths, and near linear time
Jittat Fakcharoenphol
,
Satish Rao
Journal of Computer and System Sciences
72
(5), 2006, pp. 868-889
Simple distributed algorithms for approximating minimum Steiner trees
Parinya Chalermsook
,
Jittat Fakcharoenphol
Lecture Notes in Computer Science
3595
, 2005, pp. 380-389
A tight bound on approximating arbitrary metrics by tree metrics
Jittat Fakcharoenphol
,
Satish Rao
,
Kunal Talwar
Journal of Computer and System Sciences
69
(4), 2004, pp. 485-497
A tight bound on approximating arbitrary metrics by tree metrics
Jittat Fakcharoenphol
,
Satish Rao
,
Kunal Talwar
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 448-455