The following pages link to Peng-Jun Wan (Q224522):
Displaying 50 items.
- Connected dominating set. Theory and applications (Q436191) (← links)
- (Q621835) (redirect page) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528) (← links)
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039) (← links)
- TWDM multichannel lightwave hypercube networks (Q1127544) (← links)
- Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs (Q1274997) (← links)
- A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem (Q1356538) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network (Q1369751) (← links)
- A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem (Q1391318) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- On the design, development, deployment, and network survivability analysis of the dynamic routing system protocol (Q1610587) (← links)
- Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- Traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1810863) (← links)
- Minimum-energy broadcasting in static ad hoc wireless networks (Q1859470) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Gaussian downlink user selection subject to access limit, power budget, and rate demands (Q2167901) (← links)
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks (Q2266832) (← links)
- Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks (Q2267270) (← links)
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- On ring grooming in optical networks (Q2385478) (← links)
- OVSF-CDMA code assignment in wireless ad hoc networks (Q2471712) (← links)
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks (Q2498988) (← links)
- Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks (Q2506800) (← links)
- Minimizing drop cost for SONET/WDM networks with ? wavelength requirements (Q2714912) (← links)
- (Q2716085) (← links)
- SEPARATING POINTS BY AXIS-PARALLEL LINES (Q3373055) (← links)
- Coverage by randomly deployed wireless sensor networks (Q3547764) (← links)
- ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS (Q3560067) (← links)
- (Q3579442) (← links)
- Algorithms for Minimum m-Connected k-Dominating Set Problem (Q3611970) (← links)
- ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS (Q3634202) (← links)
- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs (Q3637048) (← links)
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks (Q3652256) (← links)
- Thek-Steiner Ratio in the Rectilinear Plane (Q4217299) (← links)
- (Q4247455) (← links)
- (Q4250415) (← links)
- (Q4363167) (← links)
- (Q4506269) (← links)
- A Radio Coloring of a Hypercube (Q4551460) (← links)
- (Q4883383) (← links)
- Asymptotic Critical Transmission Radius for $k$-Connectivity in Wireless <i>Ad Hoc</i> Networks (Q5281459) (← links)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)
- Computing and Combinatorics (Q5716930) (← links)
- Computing and Combinatorics (Q5716941) (← links)
