The following pages link to Yingli Ran (Q281787):
Displaying 24 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Primal dual based algorithm for degree-balanced spanning tree problem (Q1740242) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Primal dual algorithm for partial set multi-cover (Q2327119) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations (Q4554549) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- Approximation algorithms for maximum weighted target cover problem with distance limitations (Q6571268) (← links)
- Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio (Q6580540) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)
- Approximate realizations for outerplanaric degree sequences (Q6655667) (← links)
