Hardness and Approximation of Gathering in Static Radio Networks

doi 10.1109/percomw.2006.62
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm

2008English

Optimization of Cognitive Radio Secondary Information Gathering Station Positioning and Operating Channel Selection for IoT Sensor Networks

Mobile Information Systems
Computer NetworksComputer Science ApplicationsCommunications
2018English

Approximation Algorithms and Hardness of Thek-Route Cut Problem

ACM Transactions on Algorithms
Mathematics
2016English

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Partial Gathering of Mobile Agents in Arbitrary Networks

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2019English

Data Gathering and Data Aggregation in Wireless Sensor Networks

2012English

Analysis of Methods for Determining of Static Wood Hardness

EasternEuropean Journal of Enterprise Technologies
ControlElectronic EngineeringIndustrialMechanical EngineeringEnergy EngineeringApplied MathematicsSystems EngineeringManufacturing EngineeringComputer Science ApplicationsElectricalInnovationManagement of TechnologyPower Technology
2014English

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Scheduling in Data Gathering Networks With Background Communications

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy