Pages that link to "Item:Q1104865"

The following pages link to The algebraic degree of geometric optimization problems (Q1104865):

Displaying 47 items.

• A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
• How bad can the centroid be? (Q322839) (← links)
• The Fermat-Torricelli problem. I: A discrete gradient-method approach (Q368737) (← links)
• On triangulation axes of polygons (Q458384) (← links)
• Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200) (← links)
• The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
• Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
• On stars and Steiner stars (Q834191) (← links)
• The algebraic degree of semidefinite programming (Q847857) (← links)
• Largest and smallest convex hulls for imprecise points (Q848964) (← links)
• On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (Q924547) (← links)
• Generalized median graph computation by means of graph embedding in vector spaces (Q962746) (← links)
• Improved bounds on the average distance to the Fermat-Weber center of a convex object (Q976108) (← links)
• The projection median of a set of points (Q1025289) (← links)
• Single facility collection depots location problem in the plane (Q1025297) (← links)
• Power-aware scheduling for makespan and flow (Q1041350) (← links)
• Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
• The dynamics and internal geometry of the three-city noxious location problem (Q1310194) (← links)
• The Fermat-Torricelli point and isosceles tetrahedra (Q1321697) (← links)
• Improved upper bounds for the Steiner ratio (Q1662104) (← links)
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
• Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
• A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
• A quantum approach to the discretizable molecular distance geometry problem (Q2101499) (← links)
• Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
• Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
• The Fermat-Torricelli theorem in convex geometry (Q2176079) (← links)
• A note on the unsolvability of the weighted region shortest path problem (Q2249044) (← links)
• On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
• An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
• Similarity of polygonal curves in the presence of outliers (Q2444314) (← links)
• Skeletal configurations of ribbon trees (Q2449085) (← links)
• On the Fermat-Weber center of a convex object (Q2571212) (← links)
• Robustness and asymptotics of the projection median (Q2657192) (← links)
• Simple approximative algorithms for free-support Wasserstein barycenters (Q2701424) (← links)
• Speeding up Dynamic Programming in the Line-Constrained k-median (Q2819512) (← links)
• Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
• Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
• On Combinatorial Depth Measures (Q4631012) (← links)
• SMOOTHING IMPRECISE 1.5D TERRAINS (Q4931729) (← links)
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions (Q5506731) (← links)
• Improved PTASs for convex barrier coverage (Q5896869) (← links)