Divide-and-conquer approximation algorithms via spreading metrics
From MaRDI portal
Recommendations
Cited in
(36)- Partitioning a graph into small pieces with applications to path transversal
- Efficient partitioning algorithms for optimizing big graph computation
- Exact solution of the 2-dimensional grid arrangement problem
- Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
- On the parameterized complexity of symmetric directed multicut
- Improved bounds for online balanced graph re-partitioning
- Inapproximability of \(H\)-transversal/packing
- \(d\)-dimensional arrangement revisited
- A simple algorithm for the multiway cut problem
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
- Convex relaxations for permutation problems
- Quantum circuit optimization via graph partitioning by quantum annealing
- Parameterized algorithms for generalizations of directed feedback vertex set
- Hallucination helps: energy efficient virtual circuit routing
- scientific article; zbMATH DE number 2086253 (Why is no real title available?)
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Geometric quadrisection in linear time, with application to VLSI placement
- Constant congestion routing of symmetric demands in planar directed graphs
- On a class of metrics related to graph layout problems
- On a binary distance model for the minimum linear arrangement problem
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Advances in metric embedding theory
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- An improved approximation ratio for the minimum linear arrangement problem
- Revised GRASP with path-relinking for the linear ordering problem
- Metric uniformization and spectral bounds for graphs
- The feedback arc set problem with triangle inequality is a vertex cover problem
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- Approximation algorithms for maximum linear arrangement
- Simplex transformations and the multiway cut problem
- An improved approximation algorithm for dynamic minimum linear arrangement
- Memory management optimization problems for integrated circuit simulators
- Lower bounds for the minimum linear arrangement of a graph
- New Approximation Techniques for Some Linear Ordering Problems
- Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3
- Dynamic balanced graph partitioning
This page was built for publication: Divide-and-conquer approximation algorithms via spreading metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939194)
