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