Balanced tree partition problems with virtual nodes
From MaRDI portal
Publication:2424724
DOI10.1007/s10878-018-0351-1zbMath1426.90220OpenAlexW2894512086MaRDI QIDQ2424724
Jian-Zhong Li, Baoling Ning, Shouxu Jiang
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0351-1
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
- A framework for solving VLSI graph layout problems
- Balanced graph partitioning
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- Parallel approximation schemes for problems on planar graphs
- Balanced partitions of trees and applications
- Scheduling of pipelined operator graphs
- Fast Balanced Partitioning Is Hard Even on Grids and Trees
- An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
- Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
- A class of bounded approximation algorithms for graph partitioning
- Minimizing Setup and Beam-On Times in Radiation Therapy
- A scalable multi-level preconditioner for matrix-free µ-finite element analysis of human bone structures
- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
- Applications of a Planar Separator Theorem
- One-Half Approximation Algorithms for the k-Partition Problem
- Efficient Algorithm for the Partitioning of Trees
- On the completeness of a generalized matching problem
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Computing and Combinatorics
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: Balanced tree partition problems with virtual nodes
