Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Frank Wolfe Algorithm for Nonmonotone One-Sided Smooth Function Maximization Problem

    In this paper, we study the problem of maximizing a nonmonotone one-sided- \(\eta \) smooth (OSS for short) function ...

    Hongxiang Zhang, Chunlin Hao, Wenying Guo in Computational Data and Social Networks (2023)

  2. No Access

    Chapter and Conference Paper

    On Stochastic k-Facility Location

    In the stochastic facility location problem, there are two-stage processes for the decision. A set of facilities may be opened without information for the demand of clients at the first stage; an additional se...

    Yicheng Xu, Chunlin Hao, Chenchen Wu in Algorithmic Aspects in Information and Man… (2021)

  3. No Access

    Chapter and Conference Paper

    A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement

    Energy efficiency is a critical issue that attracts numerous interest of many researchers in wireless mobile sensor networks. Emerging IoT applications have brought the MinSum Sink-based Linear Barrier Coverag...

    Wenjie Zou, Longkun Guo, Chunlin Hao in Algorithmic Aspects in Information and Man… (2021)

  4. No Access

    Chapter and Conference Paper

    Approximation Algorithms for the Lower-Bounded Knapsack Median Problem

    In this paper, we introduce the lower-bounded knapsack median problem (LB knapsack median). In this problem, we are given a set of facilities, a set of clients, a budget B and a lower bound L. Every facility is a...

    Lu Han, Chunlin Hao, Chenchen Wu in Algorithmic Aspects in Information and Man… (2020)

  5. No Access

    Chapter and Conference Paper

    Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations

    In this paper, we consider the lower-bounded k-median problem (LB k-median) that extends the classical k-median problem. In the LB k-median, a set of facilities, a set of clients and an integer k are given. Every...

    Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang in Computing and Combinatorics (2020)

  6. No Access

    Chapter and Conference Paper

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

    In this paper, we study the k-means problem with (nonuniform) penalties (k-MPWP) which is a natural generalization of the classic k-means problem. In the k-MPWP, we are given an n-client set

    Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu in Computing and Combinatorics (2017)