scientific article; zbMATH DE number 5485537
From MaRDI portal
Publication:3549709
Cited in
(57)- Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
- Sparse Semi-Oblivious Routing: Few Random Paths Suffice
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- On minimum vertex bisection of random \(d\)-regular graphs
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
- Interpreting the basis path set in neural networks
- Dynamic balanced graph partitioning
- The minimum degree group Steiner problem
- On the advantage of overlapping clusters for minimizing conductance
- Survey on oblivious routing strategies
- On the parameterized complexity of computing balanced partitions in graphs
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Center-based clustering under perturbation stability
- Minimum nonuniform graph partitioning with unrelated weights
- Bisection of bounded treewidth graphs by convolutions
- Electric routing and concurrent flow cutting
- Unbalanced graph cuts with minimum capacity
- An approximation algorithm for the generalized \(k\)-multicut problem
- Randomized contractions for multiobjective minimum cuts
- The checkpoint problem
- Metric extension operators, vertex sparsifiers and Lipschitz extendability
- Approximation algorithms for fragmenting a graph against a stochastically-located threat
- Vertex sparsification in trees
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs
- Optimal cuts and partitions in tree metrics in polynomial time
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Balanced partitions of trees and applications
- An exact combinatorial algorithm for minimum graph bisection
- Constructing the basis path set by eliminating the path dependency
- Serving in the dark should be done non-uniformly
- Unbalanced graph partitioning
- Minimum bisection is NP-hard on unit disk graphs
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- scientific article; zbMATH DE number 7651175 (Why is no real title available?)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
- Randomized oblivious integral routing for minimizing power cost
- Affine routing for robust network design
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism
- Near-optimal distributed maximum flow
- Fast balanced partitioning is hard even on grids and trees
- scientific article; zbMATH DE number 7525479 (Why is no real title available?)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Terminal embeddings
- On the approximability of robust network design
- Thresholded covering algorithms for robust and max-min optimization
- Oblivious routing for sensor network topologies
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Minimum Bisection Is Fixed-Parameter Tractable
- On minimum bisection and related partition problems in graphs with bounded tree width
- Improved analysis of online balanced clustering
- scientific article; zbMATH DE number 7525512 (Why is no real title available?)
- Restricted cuts for bisections in solid grids: a proof via polygons
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
- Refined vertex sparsifiers of planar graphs
- Partitioning a graph into small pieces with applications to path transversal
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549709)
