OpenAlex
PricingAboutJobs
Log inGet started
Work

Approximation for minimum total dominating set

HTML

Year: 2009
Type: conference-paper
Source: International Conference on Information Sciences and Interaction Sciences
DOI: 10.1145/1655925.1655948
Author: Junmin Zhu
Institution: Shanghai Jiao Tong University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: total dominating sets, approximation algorithms, greedy algorithm, approximation ratio, hardness of approximation, maximum degree, sparse graphs, directed graphs

Open Access status: closed

Funder: National Natural Science Foundation of China
Award: 参数复杂性理论的研究
OpenAlex ID: W2007607373
FWCI: 0.257
Cites: 16
Cited by: 20
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
Security