Dynamic Balanced Graph Partitioning (Q5130579): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.02074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive clustering of stochastic communication patterns on a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online balanced repartitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line generalized Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Paging for General Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive distributed file allocation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On page migration and other relaxed task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for distributed data management. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variants of File Caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online file caching with rejection penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximate Graph Partitioning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum bisection size (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced partitions of trees and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Page replacement with multi-size pages and applications to web caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive randomized algorithms for nonuniform problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Good is Recursive Bisection? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Network Design Algorithms via Hierarchical Decompositions / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3048797432 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 30 July 2024

scientific article; zbMATH DE number 7267908
Language Label Description Also known as
English
Dynamic Balanced Graph Partitioning
scientific article; zbMATH DE number 7267908

    Statements

    Dynamic Balanced Graph Partitioning (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 October 2020
    0 references
    clustering
    0 references
    graph partitioning
    0 references
    competitive analysis
    0 references
    cloud computing
    0 references
    0 references
    0 references

    Identifiers

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