Geometric Approximation Algorithms
暂无分享,去创建一个
[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[2] A. M. Macbeath,et al. A Compactness Theorem For Affine Equivalence-Classes of Convex Regions , 1951, Canadian Journal of Mathematics.
[3] M. E. Muller,et al. A Note on the Generation of Random Normal Deviates , 1958 .
[4] Frank E. Grubbs,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[5] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[6] R. Dudley. Metric Entropy of Some Classes of Sets with Differentiable Boundaries , 1974 .
[7] Steven J. Leon. Linear Algebra With Applications , 1980 .
[8] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..
[9] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[10] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[11] Irene Gargantini,et al. An effective way to represent quadtrees , 1982, CACM.
[12] Kenneth L. Clarkson,et al. Fast algorithms for the all nearest neighbors problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[13] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .
[14] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[15] Richard Pollack,et al. On the Number of k-Subsets of a Set of n Points in the Plane , 1984, J. Comb. Theory, Ser. A.
[16] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[17] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[18] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[19] Pravin M. Vaidya. An optimal algorithm for the all-nearest-neighbors problem , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[20] Noga Alon,et al. The number of small semispaces of a finite set of points in the plane , 1986, J. Comb. Theory, Ser. A.
[21] Emo Welzl. More onk-sets of finite sets in the plane , 1986, Discret. Comput. Geom..
[22] Kenneth L. Clarkson,et al. New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..
[23] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[24] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[25] Bernard Chazelle,et al. A deterministic view of random sampling and its use in geometry , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[26] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[27] Peter Frankl,et al. The Johnson-Lindenstrauss lemma and the sphericity of some graphs , 1987, J. Comb. Theory, Ser. B.
[28] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[29] Ömer Egecioglu,et al. Approximating the Diameter of a Set of Points in the Euclidean Space , 1989, Inf. Process. Lett..
[30] Bernard Chazelle,et al. Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..
[31] L. Chew. Building Voronoi Diagrams for Convex Polygons in Linear Expected Time , 1990 .
[32] J. Matousek,et al. Bi-Lipschitz embeddings into low-dimensional Euclidean spaces , 1990 .
[33] R. Durrett. Probability: Theory and Examples , 1993 .
[34] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[35] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[36] Jirí Matousek,et al. Efficient partition trees , 1991, SCG '91.
[37] Raimund Seidel,et al. Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..
[38] Micha Sharir,et al. A subexponential bound for linear programming , 1992, SCG '92.
[39] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[40] Micha Sharir,et al. A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.
[41] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[42] Emo Welzl,et al. On Spanning Trees with Low Crossing Numbers , 1992, Data Structures and Efficient Algorithms.
[43] János Komlós,et al. Almost tight bounds forɛ-Nets , 1992, Discret. Comput. Geom..
[44] Peter Gritzmann,et al. Inner and outerj-radii of convex bodies in finite-dimensional normed spaces , 1992, Discret. Comput. Geom..
[45] Jim Ruppert,et al. A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.
[46] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1993, Comb..
[47] Bernard Chazelle,et al. On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.
[48] Kurt Mehlhorn,et al. Four Results on Randomized Incremental Constructions , 1992, Comput. Geom..
[49] Christos Faloutsos,et al. On packing R-trees , 1993, CIKM '93.
[50] R. Seidel. Backwards Analysis of Randomized Geometric Algorithms , 1993 .
[51] Kenneth L. Clarkson,et al. Algorithms for Polytope Covering and Approximation , 1993, WADS.
[52] Hazel Everett,et al. An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems , 1993, SCG '93.
[53] Nina Amenta,et al. Helly-type theorems and Generalized Linear Programming , 1994, Discret. Comput. Geom..
[54] David Eppstein,et al. Provably Good Mesh Generation , 1994, J. Comput. Syst. Sci..
[55] Mark de Berg,et al. On lazy randomized incremental construction , 1994, STOC '94.
[56] Ketan Mulmuley,et al. An Efficient Algorithm for Hidden Surface Removal, II , 1994, J. Comput. Syst. Sci..
[57] Jirí Matousek,et al. On range searching with semialgebraic sets , 1992, Discret. Comput. Geom..
[58] Jirí Matousek. On geometric optimization with few violated constraints , 1994, SCG '94.
[59] G. Ziegler. Lectures on Polytopes , 1994 .
[60] Ketan Mulmuley,et al. Computational geometry : an introduction through randomized algorithms , 1993 .
[61] Jirí Matousek,et al. Computing many faces in arrangements of lines and segments , 1994, SCG '94.
[62] H. Sagan. Space-filling curves , 1994 .
[63] Kenneth L. Clarkson,et al. An algorithm for approximate closest-point queries , 1994, SCG '94.
[64] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[65] S. Rao Kosaraju,et al. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.
[66] Michael Goldwasser. A survey of linear programming in randomized subexponential time , 1995, SIGA.
[67] Michiel H. M. Smid,et al. Simple Randomized Algorithms for Closest Pair Problems , 1995, Nord. J. Comput..
[68] Mark de Berg,et al. Cuttings and applications , 1995, Int. J. Comput. Geom. Appl..
[69] Noga Alon,et al. A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..
[70] Kenneth L. Clarkson,et al. Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.
[71] János Pach,et al. Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.
[72] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[73] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[74] Paul B. Callahan,et al. Dealing with higher dimensions: the well-separated pair decomposition and its applications , 1995 .
[75] Jirí Matousek,et al. On Enclosing k Points by a Circle , 1995, Inf. Process. Lett..
[76] Timothy M. Chan. Fixed-dimensional linear programming queries made easy , 1996, SCG '96.
[77] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[78] Micha Sharir,et al. On levels in arrangements of lines, segments, planes, and triangles , 1997, SCG '97.
[79] L. A S Z L,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997 .
[80] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.
[81] K. Ball. An elementary introduction to modern convex geometry, in flavors of geometry , 1997 .
[82] Pavan K. Desikan,et al. An efficient algorithm for terrain simplification , 1997, SODA '97.
[83] K. Ball. An Elementary Introduction to Modern Convex Geometry , 1997 .
[84] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[85] Jirí Matousek,et al. Invitation to discrete mathematics , 1998 .
[86] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[87] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[88] Sunil Arya,et al. ANN: library for approximate nearest neighbor searching , 1998 .
[89] Mariette Yvinec,et al. Algorithmic geometry , 1998 .
[90] Tamal K. Dey,et al. Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..
[91] Robert J. Vanderbei,et al. Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.
[92] Jirí Matousek,et al. On Constants for Cuttings in the Plane , 1998, Discret. Comput. Geom..
[93] Satish Rao,et al. Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.
[94] Timothy M. Chan. Approximate Nearest Neighbor Queries Revisited , 1998, Discret. Comput. Geom..
[95] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[96] Anupam Gupta,et al. An elementary proof of the Johnson-Lindenstrauss Lemma , 1999 .
[97] Michael T. Goodrich,et al. Balanced aspect ratio trees: combining the advantages of k-d trees and octrees , 1999, SODA '99.
[98] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[99] Bengt J. Nilsson,et al. Minimum Spanning Trees in d Dimensions , 1999, Nord. J. Comput..
[100] Sariel Har-Peled,et al. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions , 1999, SODA '99.
[101] Satish Rao,et al. A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem , 1999, ESA.
[102] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[103] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[104] Piotr Indyk,et al. Sublinear time algorithms for metric space problems , 1999, STOC '99.
[105] Sariel Har-Peled,et al. Taking a walk in a planar arrangement , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[106] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[107] Piotr Indyk,et al. When crossings count — approximating the minimum spanning tree , 2000, SCG '00.
[108] Éva Tardos,et al. A constant factor approximation algorithm for a class of classification problems , 2000, STOC '00.
[109] Sariel Har-Peled,et al. Constructing Planar Cuttings in Theory and Practice , 2000, SIAM J. Comput..
[110] Anupam Gupta,et al. Embeddings of finite metrics , 2000 .
[111] Yi Li,et al. Improved bounds on the sample complexity of learning , 2000, SODA '00.
[112] Michiel Smid,et al. Closest-Point Problems in Computational Geometry , 2000, Handbook of Computational Geometry.
[113] C. Greg Plaxton,et al. The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[114] Geert-Jan Giezeman,et al. On the design of CGAL a computational geometry algorithms library , 2000, Softw. Pract. Exp..
[115] Géza Tóth,et al. Point Sets with Many k-Sets , 2000, SCG '00.
[116] Rafail Ostrovsky,et al. Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.
[117] Samir Khuller,et al. Algorithms for facility location problems with outliers , 2001, SODA '01.
[118] Kamesh Munagala,et al. Local search heuristic for k-median and facility location problems , 2001, STOC '01.
[119] Philip M. Long. Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming , 2001, WADS.
[120] Piotr Indyk,et al. Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[121] Sariel Har-Peled,et al. A practical approach for computing the diameter of a point set , 2001, SCG '01.
[122] Yuval Rabani,et al. Approximation algorithms for the 0-extension problem , 2001, SODA '01.
[123] Sariel Har-Peled. A replacement for Voronoi diagrams of near linear size , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[124] Dimitris Achlioptas,et al. Database-friendly random projections , 2001, PODS.
[125] Giri Narasimhan,et al. Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions , 2001, JEAL.
[126] Pankaj K. Agarwal,et al. Approximation Algorithms for k-Line Center , 2002, ESA.
[127] Sunil Arya,et al. Space-efficient approximate Voronoi diagrams , 2002, STOC '02.
[128] Timothy M. Chan. Closest-point problems simplified on the RAM , 2002, SODA '02.
[129] Piotr Indyk,et al. Approximate clustering via core-sets , 2002, STOC '02.
[130] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.
[131] Sunil Arya,et al. Linear-size approximate voronoi diagrams , 2002, SODA '02.
[132] Avner Magen,et al. Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications , 2002, RANDOM.
[133] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[134] Jon M. Kleinberg,et al. An Impossibility Theorem for Clustering , 2002, NIPS.
[135] V. V. Buldygin,et al. Brunn-Minkowski inequality , 2000 .
[136] David M. Mount,et al. A local search approximation algorithm for k-means clustering , 2002, SCG '02.
[137] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[138] A. Paz. Probabilistic algorithms , 2003 .
[139] Sariel Har-Peled,et al. Fast Algorithms for Computing the Smallest k-Enclosing Disc , 2003, ESA.
[140] Micha Sharir. The Clarkson-Shor Technique Revisited And Extended , 2003, Comb. Probab. Comput..
[141] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[142] Sanjoy Dasgupta,et al. An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.
[143] Timothy M. Chan. Faster core-set constructions and data stream algorithms in fixed dimensions , 2004, SCG '04.
[144] J. Pach. Towards a Theory of Geometric Graphs , 2004 .
[145] Pankaj K. Agarwal,et al. Approximating extent measures of points , 2004, JACM.
[146] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[147] Alper Üngör. O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations , 2004, LATIN.
[148] Main theorems : the classification of simple QTKE-groups , 2004 .
[149] Pankaj K. Agarwal,et al. Practical methods for shape fitting and kinetic data structures using core sets , 2004, Symposium on Computational Geometry.
[150] Gary L. Miller,et al. A time efficient Delaunay refinement algorithm , 2004, SODA '04.
[151] Steven Fortune,et al. Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[152] Robert Krauthgamer,et al. Measured Descent: A New Embedding Method for Finite Metrics , 2004, FOCS.
[153] Joseph O'Rourke,et al. Finding minimal enclosing boxes , 1985, International Journal of Computer & Information Sciences.
[154] Piotr Indyk,et al. Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[155] Sariel Har-Peled,et al. Coresets for $k$-Means and $k$-Median Clustering and their Applications , 2018, STOC 2004.
[156] Boris Aronov,et al. On approximating the depth and related problems , 2005, SODA '05.
[157] Éva Tardos,et al. Algorithm design , 2005 .
[158] József Solymosi,et al. On the Number of Sums and Products , 2005 .
[159] Sariel Har-Peled,et al. Dynamic Well-Separated Pair Decomposition Made Easy , 2005, CCCG.
[160] David Eppstein,et al. The skip quadtree: a simple dynamic data structure for multidimensional data , 2005, SCG.
[161] Frank Thomson Leighton,et al. New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[162] Sariel Har-Peled,et al. Fast construction of nets in low dimensional metrics, and their applications , 2004, SCG.
[163] Timothy M. Chan. Low-Dimensional Linear Programming with Violations , 2005, SIAM J. Comput..
[164] B. Fantechi. Fundamental Algebraic Geometry , 2005 .
[165] Alper Üngör,et al. A time-optimal delaunay refinement algorithm in two dimensions , 2005, SCG.
[166] Shouhong Wang,et al. Geometric Theory of Incompressible Flows with Applications to Fluid Dynamics , 2005 .
[167] Sariel Har-Peled,et al. Fast Construction of Nets in Low-Dimensional Metrics and Their Applications , 2004, SIAM J. Comput..
[168] Ke Chen,et al. On k-Median clustering in high dimensions , 2006, SODA '06.
[169] Jia-Xing Hong,et al. Isometric Embedding of Riemannian Manifolds in Euclidean Spaces , 2006 .
[170] Rajeev Motwani,et al. Lower bounds on locality sensitive hashing , 2005, SCG '06.
[171] Haim Kaplan,et al. Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting , 2006, SODA '06.
[172] Pankaj K. Agarwal,et al. Embeddings of surfaces, curves, and moving points in euclidean space , 2007, SCG '07.
[173] Bernd Gärtner,et al. Understanding and using linear programming , 2007, Universitext.
[174] Avner Magen,et al. Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces , 2007, Discret. Comput. Geom..
[175] Piotr Indyk,et al. Nearest-neighbor-preserving embeddings , 2007, TALG.
[176] Micha Sharir,et al. On approximate halfspace range counting and relative epsilon-approximations , 2007, SCG '07.
[177] Timothy M. Chan,et al. On Approximate Range Counting and Depth , 2007, SCG '07.
[178] Andreas Christmann,et al. Support Vector Machines , 2008, Data Mining and Knowledge Discovery Handbook.
[179] Nello Cristianini,et al. Support vector machines , 2009 .
[180] M. Marshall. Positive polynomials and sums of squares , 2008 .
[181] Micha Sharir,et al. Combinatorial Geometry and Its Algorithmic Applications , 2008 .
[182] Alper Üngör,et al. Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations , 2009, Comput. Geom..
[183] Jaime Angulo Pava,et al. Solitary and periodic travelling wave solutions , 2009 .
[184] Xia Chen,et al. Random Walk Intersections: Large Deviations and Related Topics , 2010 .
[185] B. Chow,et al. The Ricci Flow: Techniques and Applications: Part III: Geometric-Analytic Aspects , 2010 .
[186] Daniel M. Kane,et al. A Sparser Johnson-Lindenstrauss Transform , 2010, ArXiv.
[187] Michael Aschbacher,et al. The Classification of Finite Simple Groups: Groups of Characteristic 2 Type , 2011 .
[188] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[189] L. Levy,et al. Hereditary Noetherian Prime Rings and Idealizers , 2011 .
[190] Haim Kaplan,et al. Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting , 2011, Discret. Comput. Geom..
[191] L. Pastur,et al. Eigenvalue Distribution of Large Random Matrices , 2011 .