Divide-and-conquer approximation algorithms via spreading metrics
From MaRDI portal
Publication:2939194
DOI10.1145/347476.347478zbMath1303.68156OpenAlexW2043520568MaRDI QIDQ2939194
No author found.
Publication date: 19 January 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/347476.347478
Related Items (29)
A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES ⋮ An improved approximation ratio for the minimum linear arrangement problem ⋮ Convex Relaxations for Permutation Problems ⋮ \(\ell ^2_2\) spreading metrics for vertex ordering problems ⋮ Memory management optimization problems for integrated circuit simulators ⋮ On a class of metrics related to graph layout problems ⋮ Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Exact solution of the 2-dimensional grid arrangement problem ⋮ Inapproximability of $H$-Transversal/Packing ⋮ A New Lower Bound for the Minimum Linear Arrangement of a Graph ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ \(d\)-dimensional arrangement revisited ⋮ Dynamic Balanced Graph Partitioning ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Metric uniformization and spectral bounds for graphs ⋮ Advances in metric embedding theory ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ Almost tight bounds for eliminating depth cycles in three dimensions ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Unnamed Item ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing ⋮ A simple algorithm for the multiway cut problem ⋮ Parameterized algorithms for generalizations of directed feedback vertex set ⋮ Geometric quadrisection in linear time, with application to VLSI placement ⋮ Multicommodity flows and cuts in polymatroidal networks ⋮ Partitioning a graph into small pieces with applications to path transversal ⋮ Simplex Transformations and the Multiway Cut Problem ⋮ Approximation algorithms for maximum linear arrangement
This page was built for publication: Divide-and-conquer approximation algorithms via spreading metrics
