Approximation-preserving reduction

In computability theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reduction… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
0102019732018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
0950-7051/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.knosys.2010.02.004 * Corresponding author. Address: Key… (More)
  • table 1
  • table 2
  • table 5
  • table 3
  • table 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper, a diffusion-based curvelet shrinkage is proposed for discontinuity-preserving denoising using a combination of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
Highly Cited
2006
Highly Cited
2006
A tournament is an oriented complete graph. The feedback arc set problem for tournaments is the optimization problem of… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider implicit-explicit (IMEX) Runge Kutta methods for hyperbolic systems of conservation laws with stiff relaxation terms… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
In the single-source unsplittable ow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : :; t k with… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The study of the approximability properties of NP-hard optimization problems has recently made great advances mainly due to the… (More)
  • figure 1.1
  • figure 3.1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The error backpropagation learning algorithm (BP) is generally considered biologically implausible because it does not use… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
For all known NP-complete problems the number of solutions in instances having solutions may vary over an exponentially large… (More)
Is this relevant?