In computer science, particularly the study of approximation algorithms, an L-reduction ("linear reduction") is a transformation of optimizationâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Ulrich Bauer, Abhishek Rathod
- ArXiv
- 2018

We consider the approximability of maximization and minimization variants of the Morse matching problem, posed as open problemsâ€¦Â (More)

Is this relevant?

2012

2012

- Yuri Pirola, Paola Bonizzoni, Tao Jiang
- IEEE/ACM Transactions on Computational Biologyâ€¦
- 2012

Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies. Pedigrees allow toâ€¦Â (More)

Is this relevant?

2010

2010

- Yuri Pirola, Paola Bonizzoni, Tao Jiang
- WABI
- 2010

Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functionalâ€¦Â (More)

Is this relevant?

2005

2005

We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under theâ€¦Â (More)

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)

Is this relevant?

1999

1999

- Viggo Kann, Sanjeev Khanna, +4 authors Michael J. Kearns
- 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?

1994

1994

- Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
- FSTTCS
- 1994

Â

Is this relevant?

1978