Pages that link to "Item:Q3318110"
From MaRDI portal
The following pages link to On the Complexity of Some Common Geometric Location Problems (Q3318110):
Displayed 45 items.
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- On the asymptotics of trimmed best \(k\)-nets (Q700155) (← links)
- A simple heuristic for the p-centre problem (Q761233) (← links)
- A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
- Demand point aggregation for planar covering location models (Q816417) (← links)
- The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
- An optimal approximation algorithm for the rectilinear m-center problem (Q911284) (← links)
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
- The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
- Location problems (Q1062596) (← links)
- A heuristic for the p-center problem in graphs (Q1098862) (← links)
- Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
- Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
- Polynomial algorithms for restricted Euclidean p-centre problems (Q1116694) (← links)
- A study on two geometric location problems (Q1122367) (← links)
- Complexity of the repeaters allocating problem (Q1183426) (← links)
- On the covering multiplicity of lattices (Q1193702) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
- On the complexity of two circle connecting problems (Q1314320) (← links)
- A theory for memory-based learning (Q1342731) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre (Q1348705) (← links)
- 2-medians in trees with pos/neg weights (Q1582068) (← links)
- A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (Q1853036) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- A heuristic algorithm for minimax sensor location in the plane (Q2370328) (← links)
- Fuzzy facility location-allocation problem under the Hurwicz criterion (Q2384629) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- A linear time algorithm for approximate 2-means clustering (Q2573339) (← links)
- On the complexity of some geometric problems in unbounded dimension (Q2638782) (← links)
- Parallel collision detection between moving robots for practical motion planning (Q2745513) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- On alternativep-center problems (Q4015966) (← links)
- A fast algorithm for locating supplying center on a lattice (Q4243279) (← links)
- 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES (Q4949990) (← links)
- Fast heuristics for large scale covering-location problems (Q5959388) (← links)