The following pages link to Won Jun Lee (Q1304525):
Displaying 34 items.
- (Q358653) (redirect page) (← links)
- On the union of intermediate nodes of shortest paths (Q358654) (← links)
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- On minimum submodular cover with submodular cost (Q540698) (← links)
- New dominating sets in social networks (Q604953) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- PROMISE: A distributed DSS approach to coordinating production and marketing decisions (Q1304526) (← links)
- An algebraic QoS-based resource allocation model for competitive multimedia applications (Q1857240) (← links)
- Generalized unnormalized optimal transport and its fast algorithms (Q2131050) (← links)
- Test for uniformity of exchangeable random variables on the circle (Q2132013) (← links)
- Random features for high-dimensional nonlocal mean-field games (Q2137934) (← links)
- Tropical optimal transport and Wasserstein distances (Q2154662) (← links)
- Computational mean-field information dynamics associated with reaction-diffusion equations (Q2157136) (← links)
- Mean field control problems for vaccine distribution (Q2168879) (← links)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346) (← links)
- Dual home agent (DHA)-based location management scheme in integrated cellular-WLAN networks (Q2377891) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
- Precautionary rumor containment via trustworthy people in social networks (Q2798316) (← links)
- (Q3044737) (← links)
- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks (Q3066162) (← links)
- FORESEE: An Effective and Efficient Framework for Estimating the Execution Times of IO Traces on the SSD (Q3390164) (← links)
- Strategic Planning Simulation Based on Fuzzy Cognitive Map Knowledge and Dif ferential Game (Q4420136) (← links)
- The back-and-forth method for Wasserstein gradient flows (Q4999527) (← links)
- Optimal Coverage in Wireless Sensor Networks (Q5119165) (← links)
- Controlling Propagation of Epidemics via Mean-Field Control (Q5150900) (← links)
- On cost-aware biased respondent group selection for minority opinion survey (Q5298345) (← links)
- Deep JKO: time-implicit particle methods for general nonlinear gradient flows (Q6589858) (← links)
- Monotone discretizations of levelset convex geometric PDEs (Q6644038) (← links)
- Super-Polynomial Growth of the Generalized Persistence Diagram (Q6756862) (← links)
- Geometry-Preserving Encoder/Decoder in Latent Generative Models (Q6762709) (← links)
