Approximation of the Quadratic Knapsack Problem (Q3186661): Difference between revisions

@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Densest k-Subgraph Approximation on Intersection Graphs
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between average case complexity and approximation complexity
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q3983251
@@ Property / cites work: Q3983251 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+The symmetric quadratic knapsack problem: approximation and scheduling applications
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+Graph minor theory
@@ Property / cites work: Graph minor theory / rank @@
+Normal rank
@@ Property / cites work @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for densest \(k\)-subgraph in interval graphs
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with small book thickness
@@ Property / cites work: Graphs with small book thickness / rank @@
+Normal rank
@@ Property / cites work @@
+The Knapsack Problem with Conflict Graphs
@@ Property / cites work: The Knapsack Problem with Conflict Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Quadratic Knapsack Problem on Special Graph Classes
+Normal rank
@@ Property / cites work @@
+The quadratic knapsack problem -- a survey
@@ Property / cites work: The quadratic knapsack problem -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
+Normal rank
@@ Property / cites work @@
+The quadratic 0-1 knapsack problem with series-parallel support
+Normal rank
@@ Property / cites work @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank