\(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-008-9191-1
@@ Property / DOI: 10.1007/s00453-008-9191-1 / rank @@
-Normal rank
@@ Property / cites work @@
+O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
+Normal rank
@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Euclidean distortion and the sparsest cut
@@ Property / cites work: Euclidean distortion and the sparsest cut / rank @@
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
+Normal rank
@@ Property / cites work @@
+Low-distortion embeddings of general metrics into the line
+Normal rank
@@ Property / cites work @@
+Low-dimensional embedding with extra information
@@ Property / cites work: Low-dimensional embedding with extra information / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921660
@@ Property / cites work: Q2921660 / rank @@
+Normal rank
@@ Property / cites work @@
+A framework for solving VLSI graph layout problems
+Normal rank
@@ Property / cites work @@
+On Lipschitz embedding of finite metric spaces in Hilbert space
+Normal rank
@@ Property / cites work @@
+Q2921658
@@ Property / cites work: Q2921658 / rank @@
+Normal rank
@@ Property / cites work @@
+Integrality gaps for sparsest cut and minimum linear arrangement problems
+Normal rank
@@ Property / cites work @@
+Fast Approximate Graph Partitioning Algorithms
@@ Property / cites work: Fast Approximate Graph Partitioning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Divide-and-conquer approximation algorithms via spreading metrics
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for minimum-weight vertex separators
+Normal rank
@@ Property / cites work @@
+An improved approximation ratio for the minimum linear arrangement problem
+Normal rank
@@ Property / cites work @@
+Measured descent: A new embedding method for finite metrics
+Normal rank
@@ Property / cites work @@
+Q2921657
@@ Property / cites work: Q2921657 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+The geometry of graphs and some of its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to domination problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Q4250184
@@ Property / cites work: Q4250184 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036610
@@ Property / cites work: Q4036610 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-008-9191-1
@@ Property / DOI: 10.1007/S00453-008-9191-1 / rank @@
+Normal rank