Pages that link to "Item:Q1803677"

The following pages link to Most uniform path partitioning and its use in image processing (Q1803677):

Displaying 34 items.

• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
• Max-min weight balanced connected partition (Q386475) (← links)
• Improved algorithms for path partition and related problems (Q408433) (← links)
• A plane graph representation of triconnected graphs (Q410724) (← links)
• A short note on locating facilities on a path to minimize load range equity measure (Q512998) (← links)
• A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
• Block partitions: an extended view (Q722349) (← links)
• Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
• Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
• Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
• Path equipartition in the Chebyshev norm (Q1569949) (← links)
• Uniform and most uniform partitions of trees (Q1756346) (← links)
• On a 2-dimensional equipartition problem (Q1806658) (← links)
• Continuous bottleneck tree partitioning problems (Q1827846) (← links)
• A shifting algorithm for continuous tree partitioning (Q1850820) (← links)
• The shifting algorithm technique for the partitioning of trees (Q1900135) (← links)
• Efficient algorithms for some path partitioning problems (Q1900138) (← links)
• Partitioning a matrix to minimize the maximum cost (Q1900148) (← links)
• Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
• Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
• On the uniform edge-partition of a tree (Q2370420) (← links)
• Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
• A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
• Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
• Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries (Q2806924) (← links)
• Balancing flexible lines for car components assembly (Q4398911) (← links)
• (Q5708519) (← links)
• Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
• Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)