Parameterized complexity and approximation algorithms /

QR Code

Parameterized complexity and approximation algorithms /

Enregistré dans:

Détails bibliographiques
Auteur principal:	Marx, Daniel.
Format:	Article
Langue:	English
Sujets:	Approximation algorithms Parameterized complexity
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt

Documents similaires

Parameterized complexity in cognitive modeling : foundations, applications and opportunities /
par: Rooij, Iris van.

An overview of techniques for designing parameterized algorithms /
par: Sloper, Christian.

Parameterized complexity of cardinality constrained optimization problems /
par: Cai, Leizhen.

Parameterized complexity of geometric problems /
par: Giannopoulos, Panos.

Some parameterized problems on digraphs /
par: Gutin, Gregory.

Parameterized complexity and biopolymer sequence comparison /

Fixed-parameter algorithms in phylogenetics /
par: Gramm, Jens.

Complexity and Approximation
par: Du, Ding-Zhu, et autres
Publié: (2020)

On parameterized intractability : hardness and completeness /
par: Chen, Jianer.

Techniques for practical fixed-parameter algorithms /
par: Huffner, Falk.

On the approximability of location and network design problems /
par: Krumke, Seven Oliver.
Publié: (1996)

Progress in Approximation Theory and Applicable Complex Analysis. 1st ed. 2017
par: Govil, Narendra Kumar, et autres
Publié: (2020)

Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems /
par: Gottlob, Georg.

Approximation and Online Algorithms
par: Solis-Oba, Roberto, et autres
Publié: (2020)

Sparse Approximation with Bases
par: Temlyakov, Vladimir, et autres
Publié: (2015)

Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings /
Publié: (1998)

Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings /
Publié: (1998)

Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings /
Publié: (2000)

Algorithms and complexity /
par: Wilf, Herbert S., 1931-
Publié: (2002)

Approximate molecular orbital theory
par: Pople, John A.
Publié: (1970)

Approximation and Online Algorithms. 1st ed. 2017
par: Jansen, Klaus, et autres
Publié: (2020)

Scattered data approximation
par: Wendland, Holger
Publié: (2013)

Approximate high utility itemset mining in noisy environments
par: Yoonji Baek, et autres
Publié: (2021)

Interpolation and approximation by polynomials
par: Phillips, George M.
Publié: (2003)

Introduction to approximation theory
par: Cheney, E. W.
Publié: (1966)

Intelligent Comparisons II: Operator Inequalities and Approximations
par: Anastassiou, George A.
Publié: (2020)

Granular Computing in Decision Approximation
par: Polkowski, Lech, et autres
Publié: (2015)

Applications of Padé approximation theory in fluid dynamics /
par: Pozzi, Amilcare.
Publié: (1994)

Algorithms and Complexity. 1st ed. 2017
par: Fotakis, Dimitris, et autres
Publié: (2020)

Functional analysis, approximation theory, and numerical analysis /
Publié: (1994)

Functional analysis, approximation theory, and numerical analysis /
Publié: (1994)

Functional analysis, approximation theory, and numerical analysis /
Publié: (1994)

Mathematical Analysis I: Approximation Theory
par: Deo, Naokant, et autres
Publié: (2020)

Weierstrass approximation theorem via random - sumapproach
par: Trần, Lộc Hùng
Publié: (2012)

Harmony Search Algorithm
par: Ser, Javier Del
Publié: (2020)

Weierstrass approximation theorem via random-sum approach /
par: Trân Loc Hung.

Complexity of Constraints
Publié: (2020)

Laplace approximations for large deviations of diffusion processes on Euclidean spaces /
par: Liang, Song.

Algorithms and Applications
par: Das, Sajal K., et autres
Publié: (2020)

Algorithms and Computation
par: Tokuyama, Takeshi
Publié: (2020)