The following pages link to Joseph S. B. Mitchell (Q244519):
Displaying 50 items.
- Minimum Covering with Travel Cost (Q3652227) (← links)
- 98%-Effective Lot-Sizing for One-Warehouse, Multi-Retailer Inventory Systems with Backlogging (Q3768655) (← links)
- Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms (Q4024310) (← links)
- Path Planning in 0/1/∞ Weighted Regions with Applications (Q4025920) (← links)
- (Q4037416) (← links)
- (Q4037420) (← links)
- (Q4037439) (← links)
- (Q4228431) (← links)
- A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane (Q4229405) (← links)
- (Q4252291) (← links)
- (Q4252444) (← links)
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems (Q4268710) (← links)
- On the Maximum Scatter Traveling Salesperson Problem (Q4268895) (← links)
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS (Q4289634) (← links)
- (Q4302464) (← links)
- The weighted region problem (Q4302828) (← links)
- An Optimal Algorithm for Computing Visibility in the Plane (Q4326861) (← links)
- (Q4401014) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q4458874) (← links)
- Decision Trees for Geometric Models (Q4513214) (← links)
- Voronoi Diagrams of Moving Points (Q4513216) (← links)
- Optimal decomposition of polygonal models into triangle strips (Q4557562) (← links)
- Visibility preserving terrain simplification (Q4557566) (← links)
- TSP with locational uncertainty: the adversarial model (Q4580107) (← links)
- On minimum-area hulls (Q4595498) (← links)
- Computing the L1 Geodesic Diameter and Center of a Polygonal Domain (Q4601866) (← links)
- Universal Guard Problems (Q4636515) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
- TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING (Q4682152) (← links)
- (Q4694724) (← links)
- (Q4763413) (← links)
- (Q4763415) (← links)
- (Q4778554) (← links)
- (Q4778574) (← links)
- (Q4801184) (← links)
- (Q4845369) (← links)
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON (Q4858651) (← links)
- (Q4875213) (← links)
- Spiral Serpentine Polygonization of a Planar Point Set (Q4899273) (← links)
- (Q4945516) (← links)
- (Q4952719) (← links)
- Planar bichromatic bottleneck spanning trees (Q4958386) (← links)
- Point probe decision trees for geometric concept classes (Q5060103) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 (Q5102080) (← links)
- Network optimization on partitioned pairs of points (Q5136221) (← links)
- Convex Transversals (Q5199230) (← links)
- Locating Guards for Visibility Coverage of Polygons (Q5233499) (← links)
- Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing (Q5233511) (← links)
- (Q5240127) (← links)
