Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    On-line Scheduling with a Monotonous Subsequence Constraint

    In this paper, we study a new on-line scheduling problem that each server has to process a monotonous request subsequence. The customer requests are released over-list, and the operator has to decide whether o...

    Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo in Frontiers in Algorithmics (2017)

  2. No Access

    Chapter and Conference Paper

    The Optimal Rescue Path Set Problem in Undirected Graphs

    This paper proposes the optimal rescue path set problem in an undirected graph G = (V,E), in which some vehicles have to go from a source node s to a destination node t. However, during the traveling of the vehic...

    Huili Zhang, Yinfeng Xu in Frontiers in Algorithmics and Algorithmic … (2013)

  3. No Access

    Chapter and Conference Paper

    The k-Canadian Travelers Problem with Communication

    From the online point of view, this paper studies a variation of the k-Canadian Traveler Problem (k-CTP), in which there are multiple travelers who communicate with each other to share real-time information. The ...

    Huili Zhang, Yinfeng Xu in Frontiers in Algorithmics and Algorithmic … (2011)