Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664): Difference between revisions

@@ Property / cites work @@
+Pipage rounding: a new method of constructing algorithms with proven performance guarantee
+Normal rank
@@ Property / cites work @@
+Solving the maximum edge weight clique problem via unconstrained quadratic programming
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the bi-criteria weighted MAX-CUT problem
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+On the \(k\)-coloring of intervals
@@ Property / cites work: On the \(k\)-coloring of intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Multicriteria Optimization
@@ Property / cites work: Multicriteria Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Multiobjective Knapsack Problems
@@ Property / cites work: Approximating Multiobjective Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
+Normal rank
@@ Property / cites work @@
+On approximation of max-vertex-cover
@@ Property / cites work: On approximation of max-vertex-cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888874
@@ Property / cites work: Q3888874 / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian relaxation approach to the edge-weighted clique problem
+Normal rank
@@ Property / cites work @@
+Approximability of maximum splitting of k-sets and some other Apx-complete problems
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Non-monotone submodular maximization under matroid and knapsack constraints
+Normal rank
@@ Property / cites work @@
+The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
+Normal rank
@@ Property / cites work @@
+On approximating multicriteria TSP
@@ Property / cites work: On approximating multicriteria TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037432
@@ Property / cites work: Q4037432 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3802899
@@ Property / cites work: Q3802899 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4400856
@@ Property / cites work: Q4400856 / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of schedules that are near-optimal for both makespan and total weighted completion time
+Normal rank
@@ Property / cites work @@
+Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
+Normal rank
@@ Property / cites work @@
+Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for maximizing the minimum machine completion time
+Normal rank
@@ Property / cites work @@
+Improved approximations for max set splitting and max NAE SAT
+Normal rank
@@ Property / cites work @@
+Q4250183
@@ Property / cites work: Q4250183 / rank @@
+Normal rank