Chenchen Wu

Orcid: 0000-0002-6742-8816

According to our database1, Chenchen Wu authored at least 79 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An approximation algorithm for diversity-aware fair <i>k</i>-supplier problem.
Theor. Comput. Sci., February, 2024

A Semi Brute-Force Search Approach for (Balanced) Clustering.
Algorithmica, January, 2024

Remaining Useful Life Prediction and Uncertainty Quantification for Bearings Based on Cascaded Multiscale Convolutional Neural Network.
IEEE Trans. Instrum. Meas., 2024

Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
Proceedings of the Theory and Applications of Models of Computation, 2024

2023
Vibration optimization of cantilevered bistable composite shells based on machine learning.
Eng. Appl. Artif. Intell., November, 2023

The Optimal Pricing in Blockchain-Enabled Enterprises Operation Considering Privacy Attitude and Privacy Protection.
Asia Pac. J. Oper. Res., August, 2023

Preface.
Asia Pac. J. Oper. Res., August, 2023

Effective Heuristic Techniques for Combined Robust Clustering Problem.
Asia Pac. J. Oper. Res., February, 2023

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

The Regularized Submodular Maximization via the Lyapunov Method.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Selfish bin packing under Harmonic mean cost sharing mechanism.
Optim. Lett., 2022

An approximation algorithm for stochastic multi-level facility location problem with soft capacities.
J. Comb. Optim., 2022

An approximation algorithm for the spherical k-means problem with outliers by local search.
J. Comb. Optim., 2022

Computation and algorithm for the minimum k-edge-connectivity of graphs.
J. Comb. Optim., 2022

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

Maximizing Modular plus Non-monotone Submodular Functions.
CoRR, 2022

Algorithms for online data management problems considering the storage capacities.
Comput. Electr. Eng., 2022

Approximation Algorithms for Non-Submodular Optimization Over Sliding Windows.
Asia Pac. J. Oper. Res., 2022

Two-Facility Location Games with Distance Requirement.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

2021
Approximation algorithms for the dynamic <i>k</i>-level facility location problems.
Theor. Comput. Sci., 2021

An approximation algorithm for the k-level facility location problem with outliers.
Optim. Lett., 2021

Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint.
J. Glob. Optim., 2021

A spectral partitioning algorithm for maximum directed cut problem.
J. Comb. Optim., 2021

An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties.
J. Comb. Optim., 2021

Flexible Strain Sensors Fabricated by Fused Deposition Modeling-Based Multimaterial 3D Printing with Conductive Polyurethane Composites.
Proceedings of the 27th International Conference on Mechatronics and Machine Vision in Practice, 2021

MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Approximate the Lower-Bounded Connected Facility Location Problem.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

On Stochastic k-Facility Location.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
Multi-channel chaotic encryption algorithm for color image based on DNA coding.
Multim. Tools Appl., 2020

Molcontroller: A VMD Graphical User Interface Featuring Molecule Manipulation.
J. Chem. Inf. Model., 2020

Online Joint Placement and Allocation of Virtual Network Functions With Heterogeneous Servers.
IEEE Internet Things J., 2020

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

Too Much Information Kills Information: A Clustering Perspective.
CoRR, 2020

An LP-Rounding Based Algorithm for a Uniform Capacitated Facility Location Problem with Penalties.
Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Local Search Algorithm for the Spherical k-Means Problem with Outliers.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2-Level Station Location for Bike Sharing.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

Approximation Algorithms for the Lower-Bounded Knapsack Median Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Dynamic Frequency and Amplitude Estimation for Three-Phase Unbalanced Power Systems Using the Unscented Kalman Filter.
IEEE Trans. Instrum. Meas., 2019

Improved approximation algorithm for universal facility location problem with linear penalties.
Theor. Comput. Sci., 2019

A 5-approximation algorithm for the k-prize-collecting Steiner tree problem.
Optim. Lett., 2019

Relative Power Analysis of Magnetoencephalography During Resting State in Patients with Glioma.
J. Medical Imaging Health Informatics, 2019

Approximation algorithm for squared metric two-stage stochastic facility location problem.
J. Comb. Optim., 2019

Local search approximation algorithms for the k-means problem with penalties.
J. Comb. Optim., 2019

Approximation algorithms for the fault-tolerant facility location problem with penalties.
Discret. Appl. Math., 2019

A Densely Connected Transformer for Machine Translation.
Proceedings of the 12th International Symposium on Computational Intelligence and Design, 2019

Multitask Classification of Breast Cancer Pathological Images Using SE-DenseNet.
Proceedings of the Eleventh International Conference on Advanced Computational Intelligence, 2019

Identifying Tumor in Whole-Slide Images of Breast Cancer Using Transfer Learning and Adaptive Sampling.
Proceedings of the Eleventh International Conference on Advanced Computational Intelligence, 2019

Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract).
Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

2018
Approximation and hardness results for the Max <i>k</i>-Uncut problem.
Theor. Comput. Sci., 2018

An approximation algorithm for the <i>k</i>-median problem with uniform penalties via pseudo-solution.
Theor. Comput. Sci., 2018

Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.
Math. Program., 2018

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems.
J. Glob. Optim., 2018

Approximation algorithms for precedence-constrained identical machine scheduling with rejection.
J. Comb. Optim., 2018

An approximation algorithm for k-facility location problem with linear penalties using local search scheme.
J. Comb. Optim., 2018

An approximation algorithm for soft capacitated k-facility location problem.
J. Comb. Optim., 2018

Detection of Her2 Scores and Magnification from Whole Slide Images in Multi-Task Convolutional Network.
Proceedings of the 11th International Symposium on Computational Intelligence and Design, 2018

Combining Deep Learning with Traditional Features for Classification and Segmentation of Pathological Images of Breast Cancer.
Proceedings of the 11th International Symposium on Computational Intelligence and Design, 2018

2017
An approximation algorithm for the nth power metric facility location problem with linear penalties.
Optim. Lett., 2017

Local search algorithm for universal facility location problem with linear penalties.
J. Glob. Optim., 2017

Speaker Identification System Based on Lip-Motion Feature.
Proceedings of the Computer Vision Systems - 11th International Conference, 2017

A Local Search Approximation Algorithm for the k-means Problem with Penalties.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique.
Theor. Comput. Sci., 2016

Combinatorial approximation algorithms for the robust facility location problem with penalties.
J. Glob. Optim., 2016

An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding.
J. Comb. Optim., 2016

Approximation and Hardness Results for the Max k-Uncut Problem.
Proceedings of the Combinatorial Optimization and Applications, 2016

An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach.
Theor. Comput. Sci., 2015

Approximation algorithms for the priority facility location problem with penalties.
J. Syst. Sci. Complex., 2015

An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems.
J. Comb. Optim., 2015

Safe Approximations for Distributionally Robust Joint Chance Constrained Program.
Asia Pac. J. Oper. Res., 2015

Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

A (5.83 + ϵ)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties.
Proceedings of the Combinatorial Optimization and Applications, 2015

Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
The quality control of national 1: 50000 cartographic data of topographic maps.
Proceedings of the 21st International Conference on Geoinformatics, 2013

2008
Dynamic Topology Construction for Road Network.
Proceedings of the NCM 2008, The Fourth International Conference on Networked Computing and Advanced Information Management, Gyeongju, Korea, September 2-4, 2008, 2008

2007
Design and Application of Optimal Path Service System on Multi-level Road Network.
Proceedings of the Computational Science and Its Applications, 2007


  Loading...