Minmax centered $k$-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888): Difference between revisions

Latest revision as of 18:31, 30 December 2024

scientific article; zbMATH DE number 7704066

Language	Label	Description	Also known as
English	Minmax centered $k$-partitioning of trees and applications to sink evacuation with dynamic confluent flows	scientific article; zbMATH DE number 7704066

Statements

instance of

scholarly article

0 references

title

Minmax centered $k$-partitioning of trees and applications to sink evacuation with dynamic confluent flows (English)

0 references

0 references

0 references

0 references

28 June 2023

0 references

full work available at URL

https://arxiv.org/abs/1803.09289

0 references

zbMATH Keywords

sink evacuation

0 references

dynamic flows

0 references

confluent flows

0 references

facility location

0 references

parametric search

0 references

tree partitioning

0 references

tree centroid

0 references

MaRDI profile type

Publication

0 references

cites work

A shifting algorithm for constrained min-max partition on trees

0 references

A survey of dynamic network flows

0 references

Shifting algorithms for tree partitioning with general weighting functions

0 references

The shifting algorithm technique for the partitioning of trees

0 references

A Shifting Algorithm for Min-Max Tree Partitioning

0 references

Improved algorithms for computing $k$-sink on dynamic flow path networks

0 references

Improved algorithms for computing minmax regret sinks on dynamic path and tree networks

0 references

Sink Evacuation on Trees with Dynamic Confluent Flows

0 references

Efficient algorithms for the one-dimensional $k$-center problem

0 references

(Almost) Tight bounds and existence theorems for single-commodity confluent flows

0 references

Meet and merge: approximation algorithms for confluent flows

0 references

Slowing down sorting networks to obtain faster sorting algorithms

0 references

Capacitated Confluent Flows: Complexity and Algorithms

0 references

Quickest Flows Over Time

0 references

Efficient continuous-time dynamic network flow algorithms

0 references

Constructing Maximal Dynamic Flows from Static Flows

0 references

Q4037428

0 references

Q4198056

0 references

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

0 references

The Quickest Transshipment Problem

0 references

Q3084809

0 references

An Algorithmic Approach to Network Location Problems. I: Thep-Centers

0 references

Algorithms for uniform centered partitions of trees

0 references

Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria

0 references

A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS

0 references

An $O(n \log^2 n)$ algorithm for the optimal sink location problem in dynamic tree networks

0 references

Combinatorial Optimization with Rational Objective Functions

0 references

New Results on the Complexity of p-Centre Problems

0 references

An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems

0 references

A comprehensive survey on the quickest path problem

0 references

Efficient implementation of a shifting algorithm

0 references

Q4602397

0 references

An Introduction to Network Flows over Time

0 references

An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees

0 references

Identifiers

arXiv ID

1803.09289

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S00453-022-01083-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6107888

@@ Property / DOI @@
-.1007/s00453-022-01083-y
@@ Property / DOI: 10.1007/s00453-022-01083-y / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2795061728
@@ Property / OpenAlex ID: W2795061728 / rank @@
+Normal rank
@@ Property / cites work @@
+A shifting algorithm for constrained min-max partition on trees
+Normal rank
@@ Property / cites work @@
+A survey of dynamic network flows
@@ Property / cites work: A survey of dynamic network flows / rank @@
+Normal rank
@@ Property / cites work @@
+Shifting algorithms for tree partitioning with general weighting functions
+Normal rank
@@ Property / cites work @@
+The shifting algorithm technique for the partitioning of trees
+Normal rank
@@ Property / cites work @@
+A Shifting Algorithm for Min-Max Tree Partitioning
+Normal rank
@@ Property / cites work @@
+Improved algorithms for computing \(k\)-sink on dynamic flow path networks
+Normal rank
@@ Property / cites work @@
+Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
+Normal rank
@@ Property / cites work @@
+Sink Evacuation on Trees with Dynamic Confluent Flows
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the one-dimensional \(k\)-center problem
+Normal rank
@@ Property / cites work @@
+(Almost) Tight bounds and existence theorems for single-commodity confluent flows
+Normal rank
@@ Property / cites work @@
+Meet and merge: approximation algorithms for confluent flows
+Normal rank
@@ Property / cites work @@
+Slowing down sorting networks to obtain faster sorting algorithms
+Normal rank
@@ Property / cites work @@
+Capacitated Confluent Flows: Complexity and Algorithms
+Normal rank
@@ Property / cites work @@
+Quickest Flows Over Time
@@ Property / cites work: Quickest Flows Over Time / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient continuous-time dynamic network flow algorithms
+Normal rank
@@ Property / cites work @@
+Constructing Maximal Dynamic Flows from Static Flows
+Normal rank
@@ Property / cites work @@
+Q4037428
@@ Property / cites work: Q4037428 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
+Normal rank
@@ Property / cites work @@
+The Quickest Transshipment Problem
@@ Property / cites work: The Quickest Transshipment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3084809
@@ Property / cites work: Q3084809 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+Algorithms for uniform centered partitions of trees
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
+Normal rank
@@ Property / cites work @@
+A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS
+Normal rank
@@ Property / cites work @@
+An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization with Rational Objective Functions
+Normal rank
@@ Property / cites work @@
+New Results on the Complexity of <i>p</i>-Centre Problems
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank
@@ Property / cites work @@
+A comprehensive survey on the quickest path problem
+Normal rank
@@ Property / cites work @@
+Efficient implementation of a shifting algorithm
@@ Property / cites work: Efficient implementation of a shifting algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4602397
@@ Property / cites work: Q4602397 / rank @@
+Normal rank
@@ Property / cites work @@
+An Introduction to Network Flows over Time
@@ Property / cites work: An Introduction to Network Flows over Time / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
+Normal rank
@@ Property / DOI @@
+.1007/S00453-022-01083-Y
@@ Property / DOI: 10.1007/S00453-022-01083-Y / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6107888

Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888): Difference between revisions

Latest revision as of 18:31, 30 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)