Donglei Du

Yue Kang

J. Comb. Optim., 2022

Bicriteria streaming algorithms to balance gain and cost with cardinality constraint.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

The spherical k-means++ algorithm via local search scheme.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

An approximation algorithm for the uniform capacitated k-means problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization.

[BibT_eX]

[DOI]

CoRR, 2022

An improved approximation algorithm for maximizing a DR-submodular function over a convex set.

[BibT_eX]

[DOI]

CoRR, 2022

Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Two-Stage BP Maximization Under p-matroid Constraint.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Bicriteria algorithms to balance coverage and cost in team formation under online model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Online algorithms for BP functions maximization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Optimal Replenishment Strategy for Inventory Mechanism with Step-Shaped Demand.

[BibT_eX]

[DOI]

Yiju Wang

Jingfu Huang

J. Optim. Theory Appl., 2021

Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

A spectral partitioning algorithm for maximum directed cut problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Non-Submodular Maximization with Matroid and Knapsack Constraints.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2021

Distributed Fair k-Center Clustering Problems with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2021

Approximation Algorithms for the Lower Bounded Correlation Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

Differentially Private Submodular Maximization over Integer Lattice.

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions.

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Improved Algorithms for Non-submodular Function Maximization Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

A Primal-Dual Algorithm for Euclidean k-Means Problem with Penalties.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

Approximation Algorithms for General Cluster Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

The Spherical k-means++ Algorithm via Local Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

Approximation Algorithm for Stochastic Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

Online BP Functions Maximization.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Improved approximation algorithm for universal facility location problem with linear penalties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Improved price of anarchy for machine scheduling games with coordination mechanisms.

[BibT_eX]

[DOI]

Optim. Lett., 2019

An approximation algorithm for the dynamic facility location problem with outliers.

[BibT_eX]

[DOI]

Optim. Lett., 2019

A 5-approximation algorithm for the k-prize-collecting Steiner tree problem.

[BibT_eX]

[DOI]

Optim. Lett., 2019

Approximation algorithm for squared metric facility location problem with nonuniform capacities.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Approximation algorithms for the fault-tolerant facility location problem with penalties.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Maximization of Constrained Non-submodular Functions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

An approximation algorithm for the k-median problem with uniform penalties via pseudo-solution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain.

[BibT_eX]

[DOI]

J. Glob. Optim., 2018

Approximation algorithms for precedence-constrained identical machine scheduling with rejection.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

An approximation algorithm for k-facility location problem with linear penalties using local search scheme.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

An approximation algorithm for soft capacitated k-facility location problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

A local search approximation algorithm for the uniform capacitated k-facility location problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Editorial: Special Issue on Computing and Combinatorics.

[BibT_eX]

[DOI]

Algorithmica, 2018

A Hashing Power Allocation Game in Cryptocurrencies.

[BibT_eX]

[DOI]

Yukun Cheng

Qiaoming Han

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

An approximation algorithm for the nth power metric facility location problem with linear penalties.

[BibT_eX]

[DOI]

Optim. Lett., 2017

Local search algorithm for universal facility location problem with linear penalties.

[BibT_eX]

[DOI]

J. Glob. Optim., 2017

Incorporating Positional Information into Deep Belief Networks for Sentiment Classification.

[BibT_eX]

[DOI]

Yong Jin

Harry Zhang

Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2017

2016

Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Editorial for Computing and Combinatorics Conference.

[BibT_eX]

[DOI]

Ding-Zhu Du

Theor. Comput. Sci., 2016

An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Improving Deep Belief Networks via Delta Rule for Sentiment Classification.

[BibT_eX]

[DOI]

Yong Jin

Harry Zhang

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

Gaussian Neuron in Deep Belief Network for Sentiment Prediction.

[BibT_eX]

[DOI]

Yong Jin

Harry Zhang

Proceedings of the Advances in Artificial Intelligence, 2016

2015

Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On-line preemptive machine scheduling with ℓp norm on two uniform machines.

[BibT_eX]

[DOI]

Tianping Shuai

Xiaoyue Jiang

J. Sched., 2015

Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines.

[BibT_eX]

[DOI]

Xujin Chen

Luis Fernando Zuluaga

Theory Comput. Syst., 2015

An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Guest Editorial.

[BibT_eX]

[DOI]

Naihua Xiu

Asia Pac. J. Oper. Res., 2015

Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties.

[BibT_eX]

[DOI]

Algorithmica, 2015

Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

A (5.83 + ϵ)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems.

[BibT_eX]

[DOI]

Zi Xu

J. Comb. Optim., 2014

A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Technical Note - A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula.

[BibT_eX]

[DOI]

Qiaoming Han

Luis F. Zuluaga

Oper. Res., 2014

A cost-sharing method for the multi-level economic lot-sizing game.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2014

Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

The complexity of two supply chain scheduling problems.

[BibT_eX]

[DOI]

Jianfeng Ren

Inf. Process. Lett., 2013

Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Improved approximation algorithms for the robust fault-tolerant facility location problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties.

[BibT_eX]

[DOI]

Ruixing Lu

Algorithmica, 2012

2011

Erratum to: "An approximation algorithm for the k-level stochastic facility location problem" [Oper. Res. Lett. 38(2010) 386-389].

[BibT_eX]

[DOI]

Zhen Wang

Adriana Felicia Gabor

Oper. Res. Lett., 2011

2010

An approximation algorithm for the k-level stochastic facility location problem.

[BibT_eX]

[DOI]

Zhen Wang

Adriana Felicia Gabor

Oper. Res. Lett., 2010

An approximation algorithm for the k-level capacitated facility location problem.

[BibT_eX]

[DOI]

Xing Wang

J. Comb. Optim., 2010

A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem.

[BibT_eX]

[DOI]

Zhen Wang

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Third-order extensions of Lo's semiparametric bound for European call options.

[BibT_eX]

[DOI]

Luis Fernando Zuluaga

Javier Peña

Eur. J. Oper. Res., 2009

2008

Integer Exact Network Synthesis Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Improved Bounds for the Symmetric Rendezvous Value on the Line.

[BibT_eX]

[DOI]

Qiaoming Han

Juan Carlos Vera

Luis Fernando Zuluaga

Oper. Res., 2008

A Lower Bound for the On-Line Preemptive Machine Scheduling with lp.

[BibT_eX]

[DOI]

Tianping Shuai

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the lp Norm.

[BibT_eX]

[DOI]

Tianping Shuai

Xiaoyue Jiang

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

The maximum residual flow problem: NP-hardness with two-arc destruction.

[BibT_eX]

[DOI]

R. Chandrasekaran

Networks, 2007

On-line Network Synthesis.

[BibT_eX]

[DOI]

Santosh N. Kabadi

Algorithmic Oper. Res., 2007

Robust Optimization Model for a Class of Uncertain Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

2006

The k-level facility location game.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

An improved algorithm for decomposing arc flows into multipath flows.

[BibT_eX]

[DOI]

Santosh N. Kabadi

Oper. Res. Lett., 2006

The multiroute maximum flow problem revisited.

[BibT_eX]

[DOI]

R. Chandrasekaran

Networks, 2006

An integrated admission control scheme for the delivery of streaming media.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

2004

Optimal preemptive semi-online scheduling on two uniform processors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Satisfiability and integer programming as complementary tools.

[BibT_eX]

[DOI]

Ruiming Li

Dian Zhou

Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, 2004

2001

On-line scheduling of small open shops.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

1998

Preemptive on-line scheduling for two uniform processors.

[BibT_eX]

[DOI]

Jianjun Wen