Pages that link to "Item:Q2939194"

The following pages link to Divide-and-conquer approximation algorithms via spreading metrics (Q2939194):

Displaying 29 items.

• Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
• On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• On a class of metrics related to graph layout problems (Q603106) (← links)
• Metric uniformization and spectral bounds for graphs (Q659931) (← links)
• An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
• \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
• Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
• Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206) (← links)
• Exact solution of the 2-dimensional grid arrangement problem (Q1926499) (← links)
• A simple algorithm for the multiway cut problem (Q2294387) (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
• Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
• \(d\)-dimensional arrangement revisited (Q2444745) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• (Q2861498) (← links)
• A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES (Q2905281) (← links)
• Convex Relaxations for Permutation Problems (Q3456867) (← links)
• A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
• Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
• Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
• Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
• Dynamic Balanced Graph Partitioning (Q5130579) (← links)
• Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
• Advances in metric embedding theory (Q5894374) (← links)
• Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)