Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On an approximation measure founded on the links between optimization and polynomial approximation theory
+Normal rank
@@ Property / cites work @@
+Differential approximation algorithms for some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Approximating k-set cover and complementary graph coloring
+Normal rank
@@ Property / cites work @@
+Q4228449
@@ Property / cites work: Q4228449 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221758
@@ Property / cites work: Q3221758 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Linear Programming in O([n3/ln n]L) Operations
@@ Property / cites work: Linear Programming in O([n3/ln n]L) Operations / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1961735