Resource allocation in bounded degree trees (Q1024215): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1130167
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-007-9121-7 / rank
Normal rank
 
Property / author
 
Property / author: Reuven Bar Yehuda / 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/s00453-007-9121-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005960287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-PTAS for unsplittable flow on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Allocation with Preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: One for the price of two: a unified approach for approximating covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optical routing on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admission control in networks with advance reservations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line admission control for general scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-007-9121-7 / rank
 
Normal rank

Latest revision as of 13:28, 10 December 2024

scientific article
Language Label Description Also known as
English
Resource allocation in bounded degree trees
scientific article

    Statements

    Resource allocation in bounded degree trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    approximation algorithms
    0 references
    bandwidth allocation
    0 references
    bounded degree trees
    0 references
    scheduling
    0 references
    storage allocation
    0 references

    Identifiers