L-reduction

Known as: Reduction 
In computer science, particularly the study of approximation algorithms, an L-reduction ("linear reduction") is a transformation of optimization… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2018
0119782018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We consider the approximability of maximization and minimization variants of the Morse matching problem, posed as open problems… (More)
  • figure 1
Is this relevant?
2012
2012
Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies. Pedigrees allow to… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2010
2010
Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2005
2005
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2003
2003
In this paper we consider a graph optimization problem called minimum monopoly problem, in which it is required to find a minimum… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
agnostic learning of neural networks with bounded fan-in. It would be interesting to extend the hardness result for networks with… (More)
Is this relevant?
1997
1997
A large class of NP optimization problems called MNP are studied. It is shown that Rmax(2) is in this class and some problems… (More)
Is this relevant?