◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yingli Ran

8 papers hereh-index 9228 citations45 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author5

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • cs.DS4
  • cs.DM3
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20182025
most citedApproximation Algorithm for the Partial Set Multi-Cover Problem

19 citations · 19 across the 7 of their papers we have counts for

collaborators
Showing 2022Show all

3 papers · 1 filter

cs.CG2022

Approximation Algorithm for Minimum p Union Under a Geometric Setting

Yingli Ran, Zhao Zhang

In a minimum p union problem (MinpU), given a hypergraph G=(V,E) and an integer p, the goal is to find a set of p hyperedges E′⊆E such that the number of verti…

cs.DS2022

A parallel algorithm for minimum weight set cover with small neighborhood property

Yingli Ran, Yaoyao Zhang, Zhao Zhang

This paper studies the minimum weight set cover (MinWSC) problem with a {\em small neighborhood cover} (SNC) property proposed by Agarwal {\it et al.} in \cite{Agarwal.}. A paralle…

cs.DM2022

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set

Chaojie Zhu, Yingli Ran, Zhao Zhang +1

A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum conne…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.