Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by R. Klasing
Hardness and Approximation of Gathering in Static Radio Networks
Related publications
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Optimization of Cognitive Radio Secondary Information Gathering Station Positioning and Operating Channel Selection for IoT Sensor Networks
Mobile Information Systems
Computer Networks
Computer Science Applications
Communications
Approximation Algorithms and Hardness of Thek-Route Cut Problem
ACM Transactions on Algorithms
Mathematics
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Partial Gathering of Mobile Agents in Arbitrary Networks
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Data Gathering and Data Aggregation in Wireless Sensor Networks
Analysis of Methods for Determining of Static Wood Hardness
EasternEuropean Journal of Enterprise Technologies
Control
Electronic Engineering
Industrial
Mechanical Engineering
Energy Engineering
Applied Mathematics
Systems Engineering
Manufacturing Engineering
Computer Science Applications
Electrical
Innovation
Management of Technology
Power Technology
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Scheduling in Data Gathering Networks With Background Communications
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software
