… constant-factor approximation algorithms for convex … form the node set of a connected graph
whose maximum link length is … the case that all but one of the p centers can move freely in a …

… convex hull to start the algorithm, we can select the first vertex as the one with smallest value
of x, and finding the adjacent vertex as the one with the largest slope (positive or negative) …

… This optimal algorithm was originally very slow but has since developed into a fast and
powerful approach that can solve large instances to optimality. This is achieved by incorporating …

… if there is an XP approximation algorithm for computing mim-width… to location problems,
p-centers in graphs have been … least δ ≥ 1, we can obtain a graph with minimum degree at least …

… As the UAVs’ flying speed, the traveling speed of people along the network edges is … As
discussed earlier, the median problems on a general graph are NP-hard problems. Further, …

… high particle counts spend considerable time in the L2O stage. Those with the most particles
stick out in these plots… have presented a fast, adaptive, and scalable algorithm for evaluating …

… apply an efficient approximation algorithm for the hypercube … The kernel includes the Kronecker
delta function δ(xi,x′ … The plots show how the surrogate model is updated based on the …

… assistance of High-Performance Computing (HPC). PODS outperforms state-of-art parallel
surrogate algorithms, and … The speed of PODS to obtain an accurate answer is about twice as …

… The AtomID-Net model was trained at an initial learning rate of 10 −3 on a single graphics
… can address this issue faster, making it more practical (Figure S2, Supporting Information). …

… Describes a fast technique for subdivision of B-spline curves and surfaces. Subdivision is a
… " of life-tables, but we can take advantage of his method for present-day computer graphics. …