Linear bounds for on-line Steiner problems (Q672394): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dicky C. K. Yan / rank
Normal rank
 
Property / author
 
Property / author: Dicky C. K. Yan / 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/0020-0190(95)00000-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990065565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-minimal trees in directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining bridge-connected and biconnected components on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Performance of greedy algorithms for the on-line steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized steiner problem in series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:17, 27 May 2024

scientific article
Language Label Description Also known as
English
Linear bounds for on-line Steiner problems
scientific article

    Statements

    Linear bounds for on-line Steiner problems (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    Analysis of algorithms
    0 references
    Competitive analysis
    0 references
    On-line algorithms
    0 references
    Steiner trees
    0 references

    Identifiers