Pages that link to "Item:Q1421460"

The following pages link to On the complexity of graph tree partition problems. (Q1421460):

Displaying 23 items.

• Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
• Optimizing wind farm cable routing considering power losses (Q723994) (← links)
• On the complexity of isoperimetric problems on trees (Q765346) (← links)
• Another greedy heuristic for the constrained forest problem (Q813973) (← links)
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
• The \(\gamma\)-connected assignment problem (Q1307813) (← links)
• The graph segmentation problem (Q1742196) (← links)
• Coherent network partitions (Q2026346) (← links)
• Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
• \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
• On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← links)
• A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
• Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
• A ``maximum node clustering'' problem (Q2479564) (← links)
• A class of heuristics for the constrained forest problem (Q2581555) (← links)
• Tree‐based Graph Partitioning Constraint (Q3171237) (← links)
• (Q3611470) (← links)
• Optimality of consecutive and nested tree partitions (Q4361177) (← links)
• Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
• Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
• The complexity of tree partitioning (Q5918926) (← links)
• Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668) (← links)
• Police service district planning (Q6667797) (← links)