Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518): 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.1016/j.aml.2012.04.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062775464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bottleneck bipartition conjecture of Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum cut with limited unbalance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for max set splitting and max NAE SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results on judicious partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds for judicious partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for pairs in partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several partitioning problems of Bollobás and Scott / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious \(k\)-partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for <i>k</i>-Partitions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced judicious bipartitions of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:48, 5 July 2024

scientific article
Language Label Description Also known as
English
Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
scientific article

    Statements

    Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (English)
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    0 references
    multi-partitioning
    0 references
    bottleneck
    0 references
    probability
    0 references
    Azuma-Hoeffding inequality
    0 references
    0 references