Pages that link to "Item:Q1143173"
From MaRDI portal
The following pages link to Structure preserving reductions among convex optimization problems (Q1143173):
Displaying 50 items.
- Differential approximation algorithm of FSMVRP (Q277103) (← links)
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- The minimum maximal k-partial-matching problem (Q395867) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Detection and localization of hidden radioactive sources with spatial statistical method (Q763204) (← links)
- Completeness in approximation classes (Q811119) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
- Structure preserving reductions among convex optimization problems (Q1143173) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- The maximum clique problem (Q1318271) (← links)
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- Minimal approximate hitting sets and rule templates (Q1594848) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- Scheduling time-constrained multicast messages in circuit-switched tree networks. (Q1853110) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
