16 citations · 27 across the 15 of their papers we have counts for
6 papers · 1 filter
An Improved Linear Extractable Sketch Data Structure for Flow Count Statistics
Patthadon Tantiameorn, Grittin Nuntasombat, Jittat Fakcharoenphol
Sketch data structures are very useful for computing statistics on streaming data, including network traffic, server requests, and financial transactions. In recent work, FermatSke…
Retraction: Improved Approximation Schemes for Dominating Set Problems in Unit Disk Graphs
Jittat Fakcharoenphol, Pattara Sukprasert
Retraction note: After posting the manuscript on arXiv, we were informed by Erik Jan van Leeuwen that both results were known and they appeared in his thesis[vL09]. A PTAS for MDS…
A PTAS for -hop MST on the Euclidean plane: Improving Dependency on
Jittat Fakcharoenphol, Nonthaphat Wongwattanakij
For any , Laue and Matijević [CCCG'07, IPL'08] give a PTAS for finding a -approximate solution to the -hop MST problem in the Euclidean plane that runs in time $(n/ε…
Finding All Useless Arcs in Directed Planar Graphs
Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert
We present a linear-time algorithm for simplifying flow networks on directed planar graphs: Given a directed planar graph on vertices, a source vertex and a sink vertex …
Faster Algorithms for Semi-Matching Problems
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
We consider the problem of finding \textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster alg…
Low congestion online routing and an improved mistake bound for online prediction of graph labeling
Jittat Fakcharoenphol, Boonserm Kijsirikul
In this paper, we show a connection between a certain online low-congestion routing problem and an online prediction of graph labeling. More specifically, we prove that if there ex…