Pages that link to "Item:Q1941958"
From MaRDI portal
The following pages link to Improved algorithms for placing undesirable facilities (Q1941958):
Displaying 13 items.
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Solving a maximin location problem on the plane with given accuracy (Q893922) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- Computing obnoxious 1-corner polygonal chains (Q2571197) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
