Connectivity Graphs of Uncertainty Regions
暂无分享,去创建一个
Srinivasan Venkatesh | Erin W. Chambers | Sándor P. Fekete | Sue Whitesides | Ulrike Stege | Svetlana Stolpner | Alejandro Erickson | Jonathan Lenchner | Jeff Sember | Christophe Weibel
[1] Joseph S. B. Mitchell,et al. Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.
[2] Bernhard Fuchs. On the hardness of range assignment problems , 2008 .
[3] Esther M. Arkin,et al. Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..
[4] David Peleg,et al. Polynomial time approximation schemes for base station coverage with minimum total radii , 2005, Comput. Networks.
[5] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[6] Herbert Edelsbrunner,et al. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere , 1995, Comput. Aided Geom. Des..
[7] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..
[8] Reinhard Klette,et al. Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons , 2010, CCCG.
[9] Joseph S. B. Mitchell,et al. Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.
[10] Joseph S. B. Mitchell,et al. A PTAS for TSP with neighborhoods among fat regions in the plane , 2007, SODA '07.
[11] David Peleg,et al. Exact Algorithms and Approximation Schemes for Base Station Placement Problems , 2002, SWAT.
[12] Esther M. Arkin,et al. Minimum-cost coverage of point sets by disks , 2006, SCG '06.
[13] Joachim Gudmundsson,et al. A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..
[14] Maarten Löffler,et al. Largest bounding box, smallest diameter, and related problems on imprecise points , 2007, Comput. Geom..
[15] Yang Yang,et al. Minimum Spanning Tree with Neighborhoods , 2007, AAIM.
[16] Yahya Ould Hamidoune,et al. Representing a planar graph by vertical lines joining different levels , 1983, Discret. Math..
[17] Manuel Abellanas,et al. Structural Tolerance and Delaunay Triangulation , 1999, Inf. Process. Lett..
[18] Joachim Gudmundsson,et al. TSP with neighborhoods of varying size , 2005, J. Algorithms.
[19] R. G. Parker,et al. Guaranteed performance heuristics for the bottleneck travelling salesman problem , 1984 .
[20] Moshe Dror,et al. Touring a sequence of polygons , 2003, STOC '03.
[21] Andrea E. F. Clementi,et al. On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..
[22] Jinhui Xu,et al. Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere , 2011, ICALP.
[23] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[24] Maarten Löffler,et al. Largest and Smallest Convex Hulls for Imprecise Points , 2010, Algorithmica.
[25] Jirí Fiala,et al. Systems of distant representatives , 2005, Discret. Appl. Math..
[26] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .