Dongmei Zhang

Orcid: 0000-0003-0018-9184

Affiliations:

Shandong Jianzhu University, Jinan, China

According to our database¹, Dongmei Zhang authored at least 61 papers between 2007 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.

[BibT_eX]

[DOI]

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

2023

On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice.

[BibT_eX]

[DOI]

J. Comb. Optim., March, 2023

Preface.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., February, 2023

Approximation algorithms for the capacitated correlation clustering problem with penalties.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2023

2022

Maximizing a monotone non-submodular function under a knapsack constraint.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

An approximation algorithm for the spherical k-means problem with outliers by local search.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

The seeding algorithm for spherical k-means clustering with penalties.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

The provably good parallel seeding algorithms for the k-means problem with penalties.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2022

Regularized two-stage submodular maximization under streaming.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2022

One-pass streaming algorithm for DR-submodular maximization with a knapsack constraint over the integer lattice.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2022

Weakly k-submodular Maximization Under Matroid Constraint.

[BibT_eX]

[DOI]

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

2021

Approximation algorithms for spherical <i>k</i>-means problem using local search scheme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A spectral partitioning algorithm for maximum directed cut problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Sequence submodular maximization meets streaming.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Streaming algorithms for robust submodular maximization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2021

Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice.

[BibT_eX]

[DOI]

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

Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

Non-submodular maximization on massive data streams.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

The seeding algorithms for spherical k-means clustering.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

The seeding algorithm for k-means problem with penalties.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Approximating the τ-relaxed soft capacitated facility location problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.

[BibT_eX]

[DOI]

CoRR, 2020

The Parallel Seeding Algorithm for k-Means Problem with Penalties.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2020

Parametric Streaming Two-Stage Submodular Maximization.

[BibT_eX]

[DOI]

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

Submodular Maximization with Bounded Marginal Values.

[BibT_eX]

[DOI]

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

The Prize-Collecting k-Steiner Tree Problem.

[BibT_eX]

[DOI]

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

Streaming Algorithms for Monotone DR-Submodular Maximization Under a Knapsack Constraint on the Integer Lattice.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures, Algorithms and Programming, 2020

An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint.

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

Local Search Algorithm for the Spherical k-Means Problem with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

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

[BibT_eX]

[DOI]

Optim. Lett., 2019

Local search approximation algorithms for the sum of squares facility location problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

Local search approximation algorithms for the k-means problem with penalties.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Approximating Robust Parameterized Submodular Function Maximization in Large-Scales.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2019

A Streaming Algorithm for k-Means with Approximate Coreset.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2019

A Discretization Algorithm for k-Means with Capacity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Optimization of Complex Systems: Theory, 2019

Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions.

[BibT_eX]

[DOI]

Proceedings of the Optimization of Complex Systems: Theory, 2019

Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint.

[BibT_eX]

[DOI]

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

The Seeding Algorithm for Functional k-Means Problem.

[BibT_eX]

[DOI]

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

Local Search Approximation Algorithms for the Spherical k-Means Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Approximation algorithms for the robust facility leasing problem.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2018

A local search approximation algorithm for a squared metric k-facility location problem.

[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

2017

A Local Search Approximation Algorithm for the k-means Problem with Penalties.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2015

An ensemble method for unbalanced sentiment classification.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Natural Computation, 2015

2012

Multi-document summarization of product reviews.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

2010

Learning to Detect Web Spam by Genetic Programming.

[BibT_eX]

[DOI]

Proceedings of the Web-Age Information Management, 11th International Conference, 2010

A comparison study of multi-class sentiment classification for Chinese reviews.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 2010

2009

Semantic Structural Similarity Measure for Clustering XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems and Mining, International Conference, 2009

An approach to XML Path retrieval.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE International Conference on Granular Computing, 2009

2008

Hierarchical Document Classification Based on a Backtracking Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008

Clustering Deep Web Databases Semantically.

[BibT_eX]

[DOI]

Proceedings of the Information Retrieval Technology, 2008

An Effective Relevance Prediction Algorithm Based on Hierarchical Taxonomy for Focused Crawling.

[BibT_eX]

[DOI]

Proceedings of the Information Retrieval Technology, 2008

2007

The Ontology Model Based on Fuzzy Description Logic.

[BibT_eX]

[DOI]

Cuiling Zhu

Jun Ma

Dongmei Zhang

Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

Query Relaxing Based on Ontology and Users_ Behavior in Service Discovery.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

Dongmei Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...