Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2010.11.002 / rank
Normal rank
 
Property / author
 
Property / author: Abhishek Kumar Kashyap / rank
Normal rank
 
Property / author
 
Property / author: Mark A. Shayman / rank
Normal rank
 
Property / author
 
Property / author: Abhishek Kumar Kashyap / rank
 
Normal rank
Property / author
 
Property / author: Mark A. Shayman / 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.1016/j.comgeo.2010.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025373161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Relay Placement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matroid approach to finding edge connectivity and packing arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Uniform Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity approximations and graph carvings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating node connectivity problems via set covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relay Node Placement in Wireless Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2010.11.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:37, 9 December 2024

scientific article
Language Label Description Also known as
English
Relay placement for fault tolerance in wireless networks in higher dimensions
scientific article

    Statements

    Relay placement for fault tolerance in wireless networks in higher dimensions (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2011
    0 references
    fault tolerance
    0 references
    network connectivity
    0 references

    Identifiers