Chan, Timothy M. Approximation schemes for 0-1 knapsack. (English) Zbl 1433.68613 Seidel, Raimund (ed.), 1st symposium on simplicity in algorithms. SOSA 2018, January 7–10, 2018, New Orleans, LA, USA. Co-located with the 29th ACM-SIAM symposium on discrete algorithms (SODA 2018). Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 61, Article 5, 12 p. (2018). MSC: 68W25 68W20 68W40 90C27 90C59 PDFBibTeX XMLCite \textit{T. M. Chan}, OASIcs -- OpenAccess Ser. Inform. 61, Article 5, 12 p. (2018; Zbl 1433.68613) Full Text: DOI
Chan, Timothy M. Improved deterministic algorithms for linear programming in low dimensions. (English) Zbl 1454.68171 ACM Trans. Algorithms 14, No. 3, Article No. 30, 10 p. (2018). MSC: 68W20 68Q25 68U05 90C05 PDFBibTeX XMLCite \textit{T. M. Chan}, ACM Trans. Algorithms 14, No. 3, Article No. 30, 10 p. (2018; Zbl 1454.68171) Full Text: DOI
Chan, Timothy M. Dynamic streaming algorithms for \(\varepsilon\)-kernels. (English) Zbl 1388.68283 Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 27, 11 p. (2016). MSC: 68U05 68W20 68W25 PDFBibTeX XMLCite \textit{T. M. Chan}, LIPIcs -- Leibniz Int. Proc. Inform. 51, Article 27, 11 p. (2016; Zbl 1388.68283) Full Text: DOI
Chan, Timothy M.; Tsakalidis, Konstantinos Optimal deterministic algorithms for 2-d and 3-d shallow cuttings. (English) Zbl 1355.68279 Discrete Comput. Geom. 56, No. 4, 866-881 (2016). MSC: 68U05 52C30 68Q25 68W20 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{K. Tsakalidis}, Discrete Comput. Geom. 56, No. 4, 866--881 (2016; Zbl 1355.68279) Full Text: DOI Link
Chan, Timothy M.; Lee, Patrick On constant factors in comparison-based geometric algorithms and data structures. (English) Zbl 1315.68251 Discrete Comput. Geom. 53, No. 3, 489-513 (2015). MSC: 68U05 68P05 68W05 68W20 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{P. Lee}, Discrete Comput. Geom. 53, No. 3, 489--513 (2015; Zbl 1315.68251) Full Text: DOI Link
Arya, Sunil; Chan, Timothy M. Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels. (English) Zbl 1395.68278 Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 416-425 (2014). MSC: 68U05 68W20 68W25 68W40 PDFBibTeX XMLCite \textit{S. Arya} and \textit{T. M. Chan}, in: Proceedings of the 30th annual symposium on computational geometry, SoCG '14, Kyoto, Japan, June 8--11, 2014. New York, NY: Association for Computing Machinery (ACM). 416--425 (2014; Zbl 1395.68278) Full Text: DOI
Chan, Timothy M.; Lee, Patrick On constant factors in comparison-based geometric algorithms and data structures. (English) Zbl 1395.68295 Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 40-49 (2014). MSC: 68U05 68P05 68W05 68W20 68W40 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{P. Lee}, in: Proceedings of the 30th annual symposium on computational geometry, SoCG '14, Kyoto, Japan, June 8--11, 2014. New York, NY: Association for Computing Machinery (ACM). 40--49 (2014; Zbl 1395.68295) Full Text: DOI Link
Chan, Timothy M.; Grant, Elyot; Könemann, Jochen; Sharpe, Malcolm Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. (English) Zbl 1421.68198 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1576-1585 (2012). MSC: 68W25 68W20 90C27 90C59 PDFBibTeX XMLCite \textit{T. M. Chan} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1576--1585 (2012; Zbl 1421.68198) Full Text: Link
Chan, Timothy M. Comparison-based time-space lower bounds for selection. (English) Zbl 1300.68032 ACM Trans. Algorithms 6, No. 2, Article No. 26, 16 p. (2010). MSC: 68Q17 68P05 68Q05 68Q25 68W20 PDFBibTeX XMLCite \textit{T. M. Chan}, ACM Trans. Algorithms 6, No. 2, Article No. 26, 16 p. (2010; Zbl 1300.68032) Full Text: DOI
Chan, Timothy M. Comparison-based time-space lower bounds for selection. (English) Zbl 1421.68057 Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 140-149 (2009). MSC: 68Q17 68P05 68Q05 68Q25 68W20 PDFBibTeX XMLCite \textit{T. M. Chan}, in: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4--6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 140--149 (2009; Zbl 1421.68057) Full Text: Link
Chan, Timothy M.; Chen, Eric Y. Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. (English) Zbl 1388.68284 Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8–10, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-501-7). 80-87 (2009). MSC: 68U05 68W20 68W40 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{E. Y. Chen}, in: Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8--10, 2009. New York, NY: Association for Computing Machinery (ACM). 80--87 (2009; Zbl 1388.68284) Full Text: DOI
Zarrabi-Zadeh, Hamid; Chan, Timothy M. An improved algorithm for online unit clustering. (English) Zbl 1185.68863 Algorithmica 54, No. 4, 490-500 (2009). MSC: 68W27 68W20 PDFBibTeX XMLCite \textit{H. Zarrabi-Zadeh} and \textit{T. M. Chan}, Algorithmica 54, No. 4, 490--500 (2009; Zbl 1185.68863) Full Text: DOI
Chan, Timothy M.; Zarrabi-Zadeh, Hamid A randomized algorithm for online unit clustering. (English) Zbl 1187.68701 Theory Comput. Syst. 45, No. 3, 486-496 (2009). MSC: 68W20 68W27 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{H. Zarrabi-Zadeh}, Theory Comput. Syst. 45, No. 3, 486--496 (2009; Zbl 1187.68701) Full Text: DOI
Afshani, Peyman; Chan, Timothy M. On approximate range counting and depth. (English) Zbl 1180.68124 Discrete Comput. Geom. 42, No. 1, 3-21 (2009). MSC: 68P05 68U05 68W20 68W25 PDFBibTeX XMLCite \textit{P. Afshani} and \textit{T. M. Chan}, Discrete Comput. Geom. 42, No. 1, 3--21 (2009; Zbl 1180.68124) Full Text: DOI
Zarrabi-Zadeh, Hamid; Chan, Timothy M. An improved algorithm for online unit clustering. (English) Zbl 1176.68248 Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 383-393 (2007). MSC: 68W27 68W20 68W40 PDFBibTeX XMLCite \textit{H. Zarrabi-Zadeh} and \textit{T. M. Chan}, Lect. Notes Comput. Sci. 4598, 383--393 (2007; Zbl 1176.68248) Full Text: DOI
Chan, Timothy M.; Zarrabi-Zadeh, Hamid A randomized algorithm for online unit clustering. (English) Zbl 1129.68583 Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14–15, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-69513-4/pbk). Lecture Notes in Computer Science 4368, 121-131 (2007). MSC: 68W20 68W40 91C20 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{H. Zarrabi-Zadeh}, Lect. Notes Comput. Sci. 4368, 121--131 (2007; Zbl 1129.68583) Full Text: DOI
Chan, Timothy M. An optimal randomized algorithm for maximum Tukey depth. (English) Zbl 1317.68246 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 430-436 (2004). MSC: 68U05 68Q17 68W20 90C05 PDFBibTeX XMLCite \textit{T. M. Chan}, in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 430--436 (2004; Zbl 1317.68246)
Chan, Timothy M. On enumerating and selecting distances. (English) Zbl 1073.52506 Int. J. Comput. Geom. Appl. 11, No. 3, 291-304 (2001). MSC: 52B55 68U05 68W20 68W40 PDFBibTeX XMLCite \textit{T. M. Chan}, Int. J. Comput. Geom. Appl. 11, No. 3, 291--304 (2001; Zbl 1073.52506) Full Text: DOI
Chan, Timothy M. Random sampling, halfspace range reporting, and construction of \((\leq k)\)-levels in three dimensions. (English) Zbl 0963.68207 SIAM J. Comput. 30, No. 2, 561-575 (2000). MSC: 68U05 68P05 52C35 68Q25 PDFBibTeX XMLCite \textit{T. M. Chan}, SIAM J. Comput. 30, No. 2, 561--575 (2000; Zbl 0963.68207) Full Text: DOI
Chan, Timothy M. Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees. (English) Zbl 1339.68309 Inf. Process. Lett. 67, No. 6, 303-304 (1998). MSC: 68W20 05C85 68W40 PDFBibTeX XMLCite \textit{T. M. Chan}, Inf. Process. Lett. 67, No. 6, 303--304 (1998; Zbl 1339.68309) Full Text: DOI Link