On the complexity of compressing two dimensional routing tables with order (Q1702127): Difference between revisions

@@ Property / cites work @@
+A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
+Normal rank
@@ Property / cites work @@
+Q2768387
@@ Property / cites work: Q2768387 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum-Minimum Sätze über Graphen
@@ Property / cites work: Maximum-Minimum Sätze über Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Compressing two-dimensional routing tables with order
+Normal rank
@@ Property / cites work @@
+Feedback arc set in bipartite tournaments is NP-complete
+Normal rank
@@ Property / cites work @@
+Integral Boundary Points of Convex Polyhedra
@@ Property / cites work: Integral Boundary Points of Convex Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Compressing two-dimensional routing tables
@@ Property / cites work: Compressing two-dimensional routing tables / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
+Normal rank