Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/978-3-540-85097-7_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1497398712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / 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 threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved methods for approximating node weighted Steiner trees and connected dominating sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better constant-factor approximation for weighted dominating set in unit disk graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving construction for connected dominating set with Steiner tree in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for constrained for constrained node weighted steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:54, 28 June 2024

scientific article; zbMATH DE number 5498463
Language Label Description Also known as
English
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
scientific article; zbMATH DE number 5498463

    Statements

    Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 January 2009
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references