Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Wei Wang / rank | |||
Property / author | |||
Property / author: Won Jun Lee / rank | |||
Property / author | |||
Property / author: Wei Wang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Won Jun Lee / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B18 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6057746 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
wireless network | |||
Property / zbMATH Keywords: wireless network / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
information propagation | |||
Property / zbMATH Keywords: information propagation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
unit disk graph | |||
Property / zbMATH Keywords: unit disk graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial time approximation scheme | |||
Property / zbMATH Keywords: polynomial time approximation scheme / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9359-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2042303061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2941641 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:08, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks |
scientific article |
Statements
Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (English)
0 references
17 July 2012
0 references
wireless network
0 references
information propagation
0 references
unit disk graph
0 references
polynomial time approximation scheme
0 references
0 references