The following pages link to Jian Li (Q290319):
Displaying 50 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- (Q368757) (redirect page) (← links)
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- (Q500976) (redirect page) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Risk management of supply and cash flows in supply chains (Q549284) (← links)
- Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm (Q625687) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Forecasting time series with genetic programming based on least square method (Q741884) (← links)
- Range queries on uncertain data (Q897858) (← links)
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games (Q989513) (← links)
- A two-stage mechanism for ordinal peer assessment (Q1617663) (← links)
- Electronic markets selection in supply chain with uncertain demand and uncertain price (Q1667009) (← links)
- Coordination of supply chain with a dominant retailer under government price regulation by revenue sharing contracts (Q1699190) (← links)
- Coordination of supply chain with a dominant retailer under demand disruptions (Q1719254) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference (Q2320597) (← links)
- Capacitated center problems with two-sided bounds and outliers (Q2405294) (← links)
- Optimal in-place suffix sorting (Q2672235) (← links)
- The load-distance balancing problem (Q2892142) (← links)
- (Q2916967) (← links)
- (Q2916983) (← links)
- Optimal Allocation for Chunked-Reward Advertising (Q2937765) (← links)
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (Q2941569) (← links)
- (Q2963926) (← links)
- (Q3054081) (← links)
- New Models and Algorithms for Throughput Maximization in Broadcast Scheduling (Q3075451) (← links)
- Densest k-Subgraph Approximation on Intersection Graphs (Q3075452) (← links)
- (Q3132195) (← links)
- (Q3174902) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- An Efficient Approximation Algorithm for Maximum Simple Sharing Problem (Q3406336) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Q3586398) (← links)
- Clustering with Diversity (Q3587379) (← links)
- Approximating the Maximum Sharing Problem (Q3603514) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q3604768) (← links)
- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games (Q3608868) (← links)
- (Q3656299) (← links)
- Stochastic <i>k</i>-Center and <i>j</i>-Flat-Center Problems (Q4575742) (← links)
- (Q4606321) (← links)
- Almost All Even Yao-Yao Graphs Are Spanners (Q4606334) (← links)
- A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i> -Median (Q4962613) (← links)
