The following pages link to Guoliang Xue (Q166207):
Displaying 50 items.
- (Q225403) (redirect page) (← links)
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- (Q593573) (redirect page) (← links)
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes (Q621840) (← links)
- Reliable ad hoc routing based on mobility prediction (Q857762) (← links)
- Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks (Q937378) (← links)
- Controlled dual perturbations for posynomial programs (Q1112725) (← links)
- On the convergence of one-dimensional simplex search (Q1114590) (← links)
- An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations (Q1128668) (← links)
- (Q1184450) (redirect page) (← links)
- Algorithms for the quickest path problem and the enumeration of quickest paths (Q1184451) (← links)
- A globally convergent algorithm for the Euclidean multiplicity location problem (Q1210269) (← links)
- Probing through the intersection of hyperplanes (Q1262211) (← links)
- A min-max resource allocation problem with substitutions (Q1262219) (← links)
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology (Q1283683) (← links)
- Algorithms for a class of isotonic regression problems (Q1283930) (← links)
- Optimization of molecular similarity index with applications to biomolecules (Q1304758) (← links)
- Optimization methods for computing global minima of nonconvex potential energy functions (Q1319002) (← links)
- Molecular conformation on the CM-5 by parallel two-level simulated annealing (Q1319005) (← links)
- Improvement on the Northby algorithm for molecular conformation: Better solutions (Q1327431) (← links)
- (Q1374370) (redirect page) (← links)
- Protein conformation of a lattice model using tabu search (Q1374371) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- An efficient algorithm for delay buffer minimization (Q1583703) (← links)
- A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology (Q1763147) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- On an open problem in spherical facility location (Q1893523) (← links)
- A polynomial time dual algorithm for the Euclidean multifacility location problem (Q1919190) (← links)
- The electric vehicle shortest-walk problem with battery exchanges (Q2357868) (← links)
- The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization (Q2369383) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths (Q2468838) (← links)
- A cost-minimization algorithm for fast location tracking in mobile wireless networks (Q2506790) (← links)
- Fast data transmission and maximal dynamic flow. (Q2583548) (← links)
- Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure (Q2725060) (← links)
- Optimal multicast trees in communication systems with channel capacities and channel reliabilities (Q2732733) (← links)
- (Q2768298) (← links)
- DIAMETER-CONSTRAINED STEINER TREES (Q2905280) (← links)
- A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES (Q2905281) (← links)
- DeyPoS: Deduplicatable Dynamic Proof of Storage for Multi-User Environments (Q2985155) (← links)
- Diameter-Constrained Steiner Tree (Q3066462) (← links)
- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree (Q3066464) (← links)
- On the Minimum Diameter Cost-Constrained Steiner Tree Problem (Q3167347) (← links)
- (Q3494488) (← links)
- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices (Q3637046) (← links)
