The following pages link to Yong Zhang (Q243623):
Displaying 50 items.
- (Q328687) (redirect page) (← links)
- Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- Constant-competitive tree node assignment (Q391778) (← links)
- (Q589376) (redirect page) (← links)
- Online tree node assignment with resource augmentation (Q652619) (← links)
- Approximation strategy-proof mechanisms for obnoxious facility location on a line (Q721939) (← links)
- Online pricing for bundles of multiple items (Q742127) (← links)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
- Online call control in cellular networks revisited (Q763482) (← links)
- Approximation algorithms for the selling with preference (Q782746) (← links)
- Greedy online frequency allocation in cellular networks (Q845962) (← links)
- A constant-competitive algorithm for online OVSF code assignment (Q848939) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- Competitive algorithms for unbounded one-way trading (Q897958) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- A note on on-line broadcast scheduling with deadlines (Q976075) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
- Unbounded one-way trading on distributions with monotone hazard rate (Q1699812) (← links)
- Uniformly inserting points on square grid (Q1944133) (← links)
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
- Influence maximization under the non-progressive linear threshold model (Q2037963) (← links)
- Robustness and approximation for the linear contract design (Q2039672) (← links)
- Search complexity: a way for the quantitative analysis of the search space (Q2039682) (← links)
- Principal-agent problem under the linear contract (Q2084610) (← links)
- Online data caching in edge-cloud collaborative system with the data center (Q2091103) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- On stochastic \(k\)-facility location (Q2151361) (← links)
- An online algorithm for data caching problem in edge computing (Q2151363) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Algorithmic pricing for the partial assignment (Q2180150) (← links)
- Approximation algorithm and incentive ratio of the selling with preference (Q2180165) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
- Approximation algorithms for the partial assignment problem (Q2197546) (← links)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Online uniformly inserting points on the sphere (Q2283824) (← links)
- Weighted throughput maximization with calibrations (Q2285098) (← links)
- Universal facility location in generalized metric space (Q2300073) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Online bin packing of fragile objects with application in cellular networks (Q2426651) (← links)
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time (Q2498983) (← links)
- Constant competitive algorithms for unbounded one-way trading under monotone hazard rate (Q2668551) (← links)
- Online Pricing for Multi-type of Items (Q2897984) (← links)
- Online Inserting Points Uniformly on the Sphere (Q2980913) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing (Q3060778) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
