default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShi Li 0001
栗师
Person information
- unicode name: 栗师
- affiliation: Nanjing University, China
- affiliation (former): University at Buffalo, Department of Computer Science and Engineering, NY, USA
- affiliation (former): Toyota Technological Institute at Chicago, IL, USA
- affiliation (PhD 2014): Princeton University, Department of Computer Science, NJ, USA
- affiliation (2004 - 2008): Tsinghua University, Department of Computer Science and Technology, State Key Laboratory of Intelligent Technology and Systems, Beijing, China
Other persons with the same name
- Shi Li (aka: Li Shi) — disambiguation page
- Shi Li 0002 — Tsinghua University, Deparment of Computer Science and Technology, State Key Lab of Intelligent Technology and System, China
- Shi Li 0003 — Ewha Womans University, Department of Computer Science and Engineering, Seoul, South Korea
- Shi Li 0004
![[0000-0002-2982-4332]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2982-4332")
— Nanjing University of Science and Technology, School of Automation, China - Shi Li 0005 — Hangzhou Dianzi University, School of Media and Design, China (and 2 more)
- Shi Li 0006 — Northeast Forestry University, College of Information and Computer Engineering, Harbin, China (and 1 more)
- Shi Li 0007 — University of Kiel, Faculty of Engineering, Germany
- Shi Li 0008 — China University of Geosciences, School of Earth Sciences and Resources, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j21]Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. ACM Trans. Algorithms 21(1): 2:1-2:9 (2025)- [c54]Shi Li:
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs. SODA 2025: 553-571 - 2024
- [j20]Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. Algorithmica 86(4): 907-943 (2024) - [c53]Michael Dinitz, Guy Kortsarz, Shi Li:
Degrees and Network Design: New Problems and Approximations. APPROX/RANDOM 2024: 3:1-3:17 - [c52]Yuda Feng, Shi Li:
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. ICALP 2024: 63:1-63:9 - [c51]Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximations for Robust s-t Path. ICALP 2024: 106:1-106:17 - [c50]Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit:
Online Load and Graph Balancing for Random Order Inputs. SPAA 2024: 491-497 - [c49]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster Linear Program for Correlation Clustering. STOC 2024: 1605-1616 - [i46]Yuda Feng, Shi Li:
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. CoRR abs/2404.15607 (2024) - [i45]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster LP for Correlation Clustering. CoRR abs/2404.17509 (2024) - [i44]Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit:
Online Load and Graph Balancing for Random Order Inputs. CoRR abs/2405.07949 (2024) - [i43]Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang:
Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations. CoRR abs/2411.02942 (2024) - 2023
- [c48]Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman:
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. FOCS 2023: 1082-1104 - [c47]Shi Li:
Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems. ICALP 2023: 86:1-86:20 - [c46]Sungjin Im, Shi Li:
Improved Approximations for Unrelated Machine Scheduling. SODA 2023: 2917-2946 - [c45]Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana:
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. STOC 2023: 775-788 - [i42]Michael Dinitz, Guy Kortsarz, Shi Li:
Degrees and Network Design: New Problems and Approximations. CoRR abs/2302.11475 (2023) - [i41]Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximation for Robust s-t Path. CoRR abs/2305.16439 (2023) - [i40]Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman:
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. CoRR abs/2309.17243 (2023) - 2022
- [j19]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. Algorithmica 84(5): 1252-1278 (2022) - [c44]Vincent Cohen-Addad, Yunus Esencayi, Chenglin Fan, Marco Gaboardi, Shi Li, Di Wang:
On Facility Location Problem in the Local Differential Privacy Model. AISTATS 2022: 3914-3929 - [c43]Xiangyu Guo, Kelin Luo, Shi Li, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. ISAAC 2022: 33:1-33:18 - [c42]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. ISAAC 2022: 36:1-36:16 - [c41]Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. SODA 2022: 3230-3236 - [c40]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Brief Announcement: Nested Active-Time Scheduling. SPAA 2022: 381-383 - [i39]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - [i38]Sungjin Im, Shi Li:
Improved Approximations for Unrelated Machine Scheduling. CoRR abs/2211.10398 (2022) - [i37]Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana:
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. CoRR abs/2211.16216 (2022) - 2021
- [c39]Xiangyu Guo, Janardhan Kulkarni, Shi Li, Jiayi Xian:
Consistent k-Median: Simpler, Better and Robust. AISTATS 2021: 1135-1143 - [c38]Shi Li, Jiayi Xian:
Online Unrelated Machine Load Balancing with Predictions Revisited. ICML 2021: 6523-6532 - [c37]Shi Li:
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms. SODA 2021: 2991-3010 - [i36]Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. CoRR abs/2110.13350 (2021) - [i35]Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Online Food Delivery to Minimize Maximum Flow Time. CoRR abs/2110.15772 (2021) - 2020
- [j18]Shi Li, Jinhui Xu, Minwei Ye:
Approximating Global Optimum for Probabilistic Truth Discovery. Algorithmica 82(10): 3091-3116 (2020) - [j17]Di Wang, Xiangyu Guo, Chaowen Guan, Shi Li, Jinhui Xu:
Estimating stochastic linear combination of non-linear regressions efficiently and scalably. Neurocomputing 399: 129-140 (2020) - [j16]Di Wang, Xiangyu Guo, Shi Li, Jinhui Xu:
Robust high dimensional expectation maximization algorithm via trimmed hard thresholding. Mach. Learn. 109(12): 2283-2311 (2020) - [j15]Shi Li:
Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities. Math. Oper. Res. 45(3): 947-965 (2020) - [j14]Shi Li:
Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations. SIAM J. Comput. 49(4) (2020) - [j13]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. SIAM J. Discret. Math. 34(3): 1649-1669 (2020) - [j12]Chandra Chekuri, Shi Li:
On the Hardness of Approximating the k-Way Hypergraph Cut problem. Theory Comput. 16: 1-8 (2020) - [c36]Di Wang, Xiangyu Guo, Chaowen Guan, Shi Li, Jinhui Xu:
Estimating Stochastic Linear Combination of Non-Linear Regressions. AAAI 2020: 6137-6144 - [c35]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM 2020: 39:1-39:21 - [c34]Xiangyu Guo, Janardhan Kulkarni, Shi Li, Jiayi Xian:
On the Facility Location Problem in Online and Dynamic Models. APPROX-RANDOM 2020: 42:1-42:23 - [c33]Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye:
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. SODA 2020: 2770-2789 - [i34]Xiangyu Guo, Janardhan Kulkarni, Shi Li, Jiayi Xian:
The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models. CoRR abs/2002.10658 (2020) - [i33]Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. CoRR abs/2003.05575 (2020) - [i32]Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Covering the Relational Join. CoRR abs/2003.09537 (2020) - [i31]Shi Li:
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms. CoRR abs/2004.01231 (2020) - [i30]Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye:
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. CoRR abs/2004.13891 (2020) - [i29]Xiangyu Guo, Janardhan Kulkarni, Shi Li, Jiayi Xian:
Consistent k-Median: Simpler, Better and Robust. CoRR abs/2008.06101 (2020) - [i28]Di Wang, Xiangyu Guo, Chaowen Guan, Shi Li, Jinhui Xu:
Estimating Stochastic Linear Combination of Non-linear Regressions Efficiently and Scalably. CoRR abs/2010.09265 (2020) - [i27]Di Wang, Xiangyu Guo, Shi Li, Jinhui Xu:
Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding. CoRR abs/2010.09576 (2020)
2010 – 2019
- 2019
- [j11]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. 20: 153:1-153:33 (2019) - [j10]Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. SIAM J. Comput. 52(on): STOC19-298-STOC19-322 (2019) - [c32]Sixu Piao, Zhongjie Ba, Lu Su, Dimitrios Koutsonikolas, Shi Li, Kui Ren:
Automating CSI Measurement with UAVs: from Problem Formulation to Energy-Optimal Solution. INFOCOM 2019: 2404-2412 - [c31]Yunus Esencayi, Marco Gaboardi, Shi Li, Di Wang:
Facility Location Problem in Differential Privacy Model Revisited. NeurIPS 2019: 8489-8498 - [c30]Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. PODS 2019: 432-449 - [c29]Shashwat Garg, Janardhan Kulkarni, Shi Li:
Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time. SODA 2019: 1570-1584 - [c28]Uriel Feige, Janardhan Kulkarni, Shi Li:
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. SODA 2019: 1585-1595 - [c27]Shi Li:
On Facility Location with General Lower Bounds. SODA 2019: 2279-2290 - [c26]Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. STOC 2019: 253-264 - [i26]Xiangyu Guo, Bundit Laekhanukit, Shi Li, Jiayi Xian:
Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding. CoRR abs/1907.11404 (2019) - [i25]Yunus Esencayi, Marco Gaboardi, Shi Li, Di Wang:
Facility Location Problem in Differential Privacy Model Revisited. CoRR abs/1910.12050 (2019) - 2018
- [c25]Janardhan Kulkarni, Shi Li:
Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models. APPROX-RANDOM 2018: 16:1-16:21 - [c24]Shi Li, Jinhui Xu, Minwei Ye:
Approximating Global Optimum for Probabilistic Truth Discovery. COCOON 2018: 96-107 - [c23]David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl:
Approximation algorithms for stochastic clustering. NeurIPS 2018: 6041-6050 - [c22]Shi Li, Xiangyu Guo:
Distributed k-Clustering for Data with Heavy Noise. NeurIPS 2018: 7849-7857 - [c21]Ravishankar Krishnaswamy, Shi Li, Sai Sandeep:
Constant approximation for k-median and k-means with outliers via iterative rounding. STOC 2018: 646-659 - [i24]Shi Li:
On Facility Location with General Lower Bounds. CoRR abs/1805.02244 (2018) - [i23]Janardhan Kulkarni, Shi Li:
Flow-time Optimization For Concurrent Open-Shop and Precedence Constrained Scheduling Models. CoRR abs/1807.02553 (2018) - [i22]Uriel Feige, Janardhan Kulkarni, Shi Li:
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. CoRR abs/1807.09885 (2018) - [i21]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation algorithms for stochastic clustering. CoRR abs/1809.02271 (2018) - [i20]Shi Li, Xiangyu Guo:
Distributed k-Clustering for Data with Heavy Noise. CoRR abs/1810.07852 (2018) - [i19]Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
O(log2k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. CoRR abs/1811.03020 (2018) - 2017
- [j9]Shi Li:
On Uniform Capacitated k-Median Beyond the Natural LP Relaxation. ACM Trans. Algorithms 13(2): 22:1-22:18 (2017) - [c20]Shi Li:
Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations. FOCS 2017: 283-294 - [c19]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO 2017: 292-304 - [c18]Shi Li:
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities. SODA 2017: 2311-2325 - [c17]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. SODA 2017: 2524-2539 - [i18]Shi Li:
Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations. CoRR abs/1707.08039 (2017) - [i17]Ravishankar Krishnaswamy, Shi Li, Sai Sandeep:
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding. CoRR abs/1711.01323 (2017) - 2016
- [j8]Julia Chuzhoy, Shi Li:
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. J. ACM 63(5): 45:1-45:51 (2016) - [j7]Shi Li, Ola Svensson:
Approximating k-Median via Pseudo-Approximation. SIAM J. Comput. 45(2): 530-547 (2016) - [j6]Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser:
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid. SIAM J. Optim. 26(4): 2059-2079 (2016) - [j5]Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. ACM Trans. Algorithms 12(3): 36:1-36:19 (2016) - [c16]Sungjin Im, Shi Li:
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions. FOCS 2016: 138-147 - [c15]H. Gökalp Demirci, Shi Li:
Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation. ICALP 2016: 73:1-73:14 - [c14]Shi Li:
Approximating capacitated k-median with (1 + ∊)k open facilities. SODA 2016: 786-796 - [c13]Julia Chuzhoy, David H. K. Kim, Shi Li:
Improved approximation for node-disjoint paths in planar graphs. STOC 2016: 556-569 - [i16]Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser:
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. CoRR abs/1602.08515 (2016) - [i15]H. Gökalp Demirci, Shi Li:
Constant Approximation for Capacitated k-Median with (1 + ε)-Capacity Violation. CoRR abs/1603.02324 (2016) - [i14]Julia Chuzhoy, David H. K. Kim, Shi Li:
Improved Approximation for Node-Disjoint Paths in Planar Graphs. CoRR abs/1603.05520 (2016) - [i13]Sungjin Im, Shi Li:
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions. CoRR abs/1606.08817 (2016) - [i12]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. CoRR abs/1608.03313 (2016) - [i11]Shi Li:
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities. CoRR abs/1610.02056 (2016) - [i10]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j4]Shi Li, Gabriel H. Tucci:
Traffic Congestion in Expanders and (p, δ)-Hyperbolic Spaces. Internet Math. 11(2): 134-142 (2015) - [c12]Shi Li:
On Uniform Capacitated k-Median Beyond the Natural LP Relaxation. SODA 2015: 696-707 - [c11]Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng:
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. SODA 2015: 1070-1086 - [c10]Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li:
On (1, ∊)-Restricted Assignment Makespan Minimization. SODA 2015: 1087-1101 - 2014
- [b1]Shi Li:
Approximation Algorithms for Network Routing and Facility Location Problems. Princeton University, USA, 2014 - [j3]Kaiyu Guan, David Medvigy, Eric F. Wood, Kelly K. Caylor, Shi Li, Su-Jong Jeong:
Deriving Vegetation Phenological Time and Trajectory Information Over Africa Using SEVIRI Daily LAI. IEEE Trans. Geosci. Remote. Sens. 52(2): 1113-1130 (2014) - [c9]MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. SODA 2014: 1-12 - [c8]Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li:
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. SODA 2014: 55-71 - [i9]Shi Li:
On Uniform Capacitated $k$-Median Beyond the Natural LP Relaxation. CoRR abs/1409.6739 (2014) - [i8]Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li:
On $(1, ε)$-Restricted Assignment Makespan Minimization. CoRR abs/1410.7506 (2014) - [i7]Shi Li:
Approximating capacitated $k$-median with $(1+ε)k$ open facilities. CoRR abs/1411.5630 (2014) - 2013
- [j2]Shi Li:
A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222: 45-58 (2013) - [c7]Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan:
Capacitated Network Design on Undirected Graphs. APPROX-RANDOM 2013: 71-80 - [c6]Shi Li, Ola Svensson:
Approximating k-median via pseudo-approximation. STOC 2013: 901-910 - [i6]Shi Li, Gabriel H. Tucci:
Traffic Congestion in Expanders, $(p,δ)$--Hyperbolic Spaces and Product of Trees. CoRR abs/1303.2952 (2013) - [i5]Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. CoRR abs/1307.2808 (2013) - 2012
- [c5]Julia Chuzhoy, Shi Li:
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. FOCS 2012: 233-242 - [c4]Moses Charikar, Shi Li:
A Dependent LP-Rounding Approach for the k-Median Problem. ICALP (1) 2012: 194-205 - [c3]Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li:
Approximation algorithms and hardness of integral concurrent flow. STOC 2012: 689-708 - [i4]Julia Chuzhoy, Shi Li:
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. CoRR abs/1208.1272 (2012) - [i3]Shi Li, Ola Svensson:
Approximating $k$-Median via Pseudo-Approximation. CoRR abs/1211.0243 (2012) - 2011
- [c2]Shi Li:
A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem. ICALP (2) 2011: 77-88 - 2010
- [j1]Xiang-Yang Li, Yunhao Liu, Shi Li, Shaojie Tang:
Multicast Capacity of Wireless Ad Hoc Networks Under Gaussian Channel Model. IEEE/ACM Trans. Netw. 18(4): 1145-1157 (2010) - [c1]Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra:
Vertex Sparsifiers and Abstract Rounding Algorithms. FOCS 2010: 265-274 - [i2]Shi Li:
On constant factor approximation for earth mover distance over doubling metrics. CoRR abs/1002.4034 (2010) - [i1]Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra:
Vertex Sparsifiers and Abstract Rounding Algorithms. CoRR abs/1006.4536 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
