OpenAlex
PricingAboutJobs
Log inGet started
Work

On the Computational Complexity of Sensor Network Localization

HTML

Year: 2004
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, ALGOSENSORS 2004, Turku, Finland, July 16, 2004. Proceedings
DOI: 10.1007/978-3-540-27820-7_5
Authors: James Aspnes, David Goldenberg, Yang Richard Yang
Institution: Yale University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: node localization, computational complexity, polynomial-time algorithms, NP-hardness, distance-based localization, unique solution, worst-case analysis

Open Access status: closed
OpenAlex ID: W18819324
FWCI: 7.496
Cites: 31
Cited by: 211
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms