Clik here to view.
Approximating Spanning Trees with Inner Nodes Cost.
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang: Approximating Spanning Trees with Inner Nodes Cost. PDCAT 2005: 660-664
View ArticleClik here to view.
On Approximating the Maximum Simple Sharing Problem.
Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu: On Approximating the Maximum Simple Sharing Problem. ISAAC 2006: 547-556
View ArticleClik here to view.
Traversing the Machining Graph.
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu: Traversing the Machining Graph. ESA 2006: 220-231
View ArticleClik here to view.
Non-metric Multicommodity and Multilevel Facility Location.
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu: Non-metric Multicommodity and Multilevel Facility Location. AAIM 2006: 138-148
View ArticleClik here to view.
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free...
Mordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. CoRR abs/0705.0253 (2007)
View ArticleClik here to view.
Approximating the Maximum Sharing Problem.
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu: Approximating the Maximum Sharing Problem. WADS 2007: 52-63
View ArticleClik here to view.
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free...
Mordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. ISAAC 2007: 329-340
View ArticleClik here to view.
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability...
Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun: Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON 2007: 439-447
View ArticleClik here to view.
Efficient Algorithms for k -Disjoint Paths Problems on DAGs.
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu: Efficient Algorithms for k -Disjoint Paths Problems on DAGs. AAIM 2007: 134-143
View ArticleClik here to view.
An O(log n / log log n}) Upper Bound on the Price of Stability for Undirected...
Jian Li: An O(log n / log log n}) Upper Bound on the Price of Stability for Undirected Shapley Network Design Games. CoRR abs/0812.2567 (2008)
View ArticleClik here to view.
Consensus Answers for Queries over Probabilistic Databases.
Jian Li, Amol Deshpande: Consensus Answers for Queries over Probabilistic Databases. CoRR abs/0812.2049 (2008)
View ArticleClik here to view.
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free...
Mordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. IEEE Trans. Inf. Theory 54(8): 3412-3424 (2008)
View ArticleClik here to view.
Energy Efficient Scheduling via Partial Shutdown.
Samir Khuller, Jian Li, Barna Saha: Energy Efficient Scheduling via Partial Shutdown. CoRR abs/0912.1329 (2009)
View ArticleClik here to view.
On Computing Compression Trees for Data Collection in Sensor Networks.
Jian Li, Amol Deshpande, Samir Khuller: On Computing Compression Trees for Data Collection in Sensor Networks. CoRR abs/0907.5442 (2009)
View ArticleClik here to view.
A Unified Approach to Ranking in Probabilistic Databases.
Jian Li, Barna Saha, Amol Deshpande: A Unified Approach to Ranking in Probabilistic Databases. CoRR abs/0904.1366 (2009)
View ArticleClik here to view.
Consensus answers for queries over probabilistic databases.
Jian Li, Amol Deshpande: Consensus answers for queries over probabilistic databases. PODS 2009: 259-268
View ArticleClik here to view.
Minimizing Communication Cost in Distributed Multi-query Processing.
Jian Li, Amol Deshpande, Samir Khuller: Minimizing Communication Cost in Distributed Multi-query Processing. ICDE 2009: 772-783
View ArticleClik here to view.
A Unified Approach to Ranking in Probabilistic Databases.
Jian Li, Barna Saha, Amol Deshpande: A Unified Approach to Ranking in Probabilistic Databases. Proc. VLDB Endow. 2(1): 502-513 (2009)
View ArticleClik here to view.
An O(log(n)/log(log(n))) upper bound on the price of stability for undirected...
Jian Li: An O(log(n)/log(log(n))) upper bound on the price of stability for undirected Shapley network design games. Inf. Process. Lett. 109(15): 876-878 (2009)
View ArticleClik here to view.
Utility Maximization under Uncertainty.
Jian Li, Amol Deshpande: Utility Maximization under Uncertainty. CoRR abs/1012.3189 (2010)
View Article