Structure preserving reductions among convex optimization problems

Cites work

scientific article; zbMATH DE number 3551892 (Why is no real title available?)
scientific article; zbMATH DE number 3560738 (Why is no real title available?)
scientific article; zbMATH DE number 3566162 (Why is no real title available?)
scientific article; zbMATH DE number 3566230 (Why is no real title available?)
scientific article; zbMATH DE number 3569828 (Why is no real title available?)
scientific article; zbMATH DE number 3571502 (Why is no real title available?)
Algorithms for Scheduling Independent Tasks
An analysis of approximations for maximizing submodular set functions—I
Approximation algorithms for combinatorial problems
Heuristic evaluation techniques for bin packing approximation algorithms
P-Complete Approximation Problems
Structure preserving reductions among convex optimization problems
The Complexity of Near-Optimal Graph Coloring

Cited in

(75)

Cost minimization in wireless networks with a bounded and unbounded number of interfaces
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
Scheduling time-constrained multicast messages in circuit-switched tree networks.
On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
Least and most colored bases
The minimum maximal k-partial-matching problem
Feedback arc set in bipartite tournaments is NP-complete
Tight localizations of feedback sets
On parallel versus sequential approximation
A PTAS for the minimization of polynomials of fixed degree over the simplex
The maximum clique problem
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
An efficient fixed-parameter algorithm for 3-hitting set
Approximability of clausal constraints
Differential approximation algorithm of FSMVRP
Differential approximation results for the traveling salesman and related problems
On the approximability and hardness of minimum topic connected overlay and its special instances
A bounded approximation for the minimum cost 2-sat problem
Optimization, approximation, and complexity classes
An Improved Approximation Bound for Spanning Star Forest and Color Saving
The complexity of egalitarian mechanisms for linear programming games
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
Red-blue covering problems and the consecutive ones property
Analyzing the complexity of finding good neighborhood functions for local search algorithms
On the parameterized complexity of compact set packing
Finding disjoint paths in networks with star shared risk link groups
The node-deletion problem for hereditary properties is NP-complete
On the complexity of approximating the independent set problem (extended abstract)
Constrained hitting set problem with intervals
A better differential approximation ratio for symmetric TSP
New differential approximation algorithm for \(k\)-customer vehicle routing problem
Optimal cost sharing for capacitated facility location games
Structure preserving reductions among convex optimization problems
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa
The generalized vertex cover problem and some variations
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Differential approximation algorithms for some combinatorial optimization problems
On an approximation measure founded on the links between optimization and polynomial approximation theory
Minimizing the stretch when scheduling flows of divisible requests
Approximate solution of NP optimization problems
On the Minimum Hitting Set of Bundles Problem
Completeness in approximation classes
On the computational hardness based on linear fpt-reductions
Approximation algorithms for some vehicle routing problems
On the parameterized complexity of compact set packing
A survey on the structure of approximation classes
Online and Approximate Network Construction from Bounded Connectivity Constraints
On the difficulty of designing good classifiers
Energy consumption minimization in ad hoc wireless and multi-interface networks
Minimal approximate hitting sets and rule templates
On the complexity of approximating the independent set problem
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
The complexity of approximating a nonlinear program
Exploiting hidden structure in selecting dimensions that distinguish vectors
Faster fixed-parameter tractable algorithms for matching and packing problems
On the minimum hitting set of bundles problem
Detection and localization of hidden radioactive sources with spatial statistical method
Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms
The maximum \(f\)-depth spanning tree problem
Max NP-completeness made easy
Bridging gap between standard and differential polynomial approximation: The case of bin-packing
Inapproximability results for graph convexity parameters
On the differential approximation of MIN SET COVER
Differential approximation results for the traveling salesman problem with distances 1 and 2
Differential approximation for optimal satisfiability and related problems
Combinatorial problems over power sets
Local search, reducibility and approximability of NP-optimization problems
On the complexity of optimization over the standard simplex
Online and approximate network construction from bounded connectivity constraints
Approximation results for the weighted \(P_4\) partition problem
On the convergence rate of grid search for polynomial optimization over the simplex
A logarithmic approximation for polymatroid congestion games
Differential approximation of NP-hard problems with equal size feasible solutions
Reductions, completeness and the hardness of approximability

This page was built for publication: Structure preserving reductions among convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143173)