L-reduction

Known as: Reduction

In computer science, particularly the study of approximation algorithms, an L-reduction ("linear reduction") is a transformation of optimization…

Papers overview

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

2017

We study the computational complexity of Power Edge Set (PES), for restricted graph classes with degree bounded by three…

2014

Recall that one of the most commonly used reductions is the L-reduction, introduced by Papadimitriou and Yannakakis in [11]. This…

2013

We consider a series of geometric problems of covering finite subsets of finite-dimensional numerical spaces by minimal families…

2010

Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional…

2007

Les pathologies cardiaques representent une cause majeure de morbidite et de mortalite. L'achevement du sequencage du genome…

2004

According to the theory of NP-completeness, many problems that have important real-world applications are NP-hard. This excludes…

2003

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…

1995

We investigate a large class of NP optimization problems which we call MNP. We show that Rmax(2) [PR] are in our class and some…

1994

We present parallel approximation schemes for a large class of problems in logic and graph theory, when these problems are…