Pages that link to "Item:Q3670553"
From MaRDI portal
The following pages link to Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems (Q3670553):
Displaying 50 items.
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- Inverse eccentric vertex problem on networks (Q301951) (← links)
- Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329) (← links)
- Isoperimetric triangular enclosures with a fixed angle (Q375380) (← links)
- Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
- Deterministic geoleader election in disoriented anonymous systems (Q393108) (← links)
- Minimum enclosing circle of a set of fixed points and a mobile point (Q396467) (← links)
- The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times (Q617517) (← links)
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
- New algorithms for mimizing the longest wire length during circuit compaction. (Q676272) (← links)
- Geometric orderings of intersecting translates and their applications (Q676584) (← links)
- The double pivot simplex method (Q684156) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- Computing shortest transversals (Q757096) (← links)
- On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
- Using enclosing ellipsoids in multiaxial fatigue strength criteria (Q817510) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- The inverse 1-median problem on a cycle (Q951097) (← links)
- Fast computation of smallest enclosing circle with center on a query line segment (Q975487) (← links)
- Improved bounds on the average distance to the Fermat-Weber center of a convex object (Q976108) (← links)
- Cooperative TSP (Q982655) (← links)
- A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- A linear programming approach to highly precise clock synchronization over a packet network (Q1029567) (← links)
