Q4638106 (Q4638106): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Egalitarian Graph Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar orientations with low out-degree and compaction of adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All maximal independent sets and dynamic dominance for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Algorithms for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining fairness with throughput / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of deferral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining Assignments Online: Matching, Scheduling, and Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness in routing and load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Lower Bounds from the 3SUM Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency queries in dynamic sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for bounded-length shortest paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Recourse for Online MST and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Deterministic Algorithms for Fully Dynamic Maximal Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line load balancing and network flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust PTAS for Machine Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load Balancing for Response Time / rank
 
Normal rank

Revision as of 14:05, 15 July 2024

scientific article; zbMATH DE number 6866341
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 6866341

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2018
    0 references
    online matching
    0 references
    graph orientation
    0 references
    minimizing the \(p\)-norm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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