Uniform and most uniform partitions of trees
From MaRDI portal
Publication:1756346
DOI10.1016/j.disopt.2018.06.003zbMath1454.05023OpenAlexW2811462317WikidataQ58217117 ScholiaQ58217117MaRDI QIDQ1756346
Federica Ricca, Andrea Scozzari, Isabella Lari, Justo Puerto
Publication date: 14 January 2019
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.06.003
Programming involving graphs or networks (90C35) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ On finding connected balanced partitions of trees
Cites Work
- Unnamed Item
- Preprocessing for a map sectorization problem by means of mathematical programming
- Clustering and community detection in directed networks: a survey
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- A shifting algorithm for constrained min-max partition on trees
- Efficient implementation of a shifting algorithm
- Clustering on trees
- Maximum split clustering under connectivity constraints
- Most uniform path partitioning and its use in image processing
- A tabu search heuristic and adaptive memory procedure for political districting
- The shifting algorithm technique for the partitioning of trees
- Reliability problems in multiple path-shaped facility location on networks
- Partitioning a weighted tree into subtrees with weights in a given range
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- Local search algorithms for political districting
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- New Results on the Complexity of p-Centre Problems
- Max-Min Tree Partitioning
- Max-min partitioning of grid graphs into connected components
- Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
- Graph Partitioning and Graph Clustering
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
- A polynomial-time algorithm for max-min partitioning of ladders
This page was built for publication: Uniform and most uniform partitions of trees
