Parameterized complexity and approximation algorithms /

QR-kod

Parameterized complexity and approximation algorithms /

Sparad:

Bibliografiska uppgifter
Huvudupphovsman:	Marx, Daniel.
Materialtyp:	Artikel
Språk:	English
Ämnen:	Approximation algorithms Parameterized complexity
Taggar:	Lägg till en tagg Inga taggar, Lägg till första taggen!

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

Liknande verk

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

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

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

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

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

Parameterized complexity and biopolymer sequence comparison /

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

Complexity and Approximation
av: Du, Ding-Zhu, et al.
Publicerad: (2020)

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

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

On the approximability of location and network design problems /
av: Krumke, Seven Oliver.
Publicerad: (1996)

Progress in Approximation Theory and Applicable Complex Analysis. 1st ed. 2017
av: Govil, Narendra Kumar, et al.
Publicerad: (2020)

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

Approximation and Online Algorithms
av: Solis-Oba, Roberto, et al.
Publicerad: (2020)

Sparse Approximation with Bases
av: Temlyakov, Vladimir, et al.
Publicerad: (2015)

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

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

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

Algorithms and complexity /
av: Wilf, Herbert S., 1931-
Publicerad: (2002)

Approximate molecular orbital theory
av: Pople, John A.
Publicerad: (1970)

Approximation and Online Algorithms. 1st ed. 2017
av: Jansen, Klaus, et al.
Publicerad: (2020)

Scattered data approximation
av: Wendland, Holger
Publicerad: (2013)

Approximate high utility itemset mining in noisy environments
av: Yoonji Baek, et al.
Publicerad: (2021)

Interpolation and approximation by polynomials
av: Phillips, George M.
Publicerad: (2003)

Introduction to approximation theory
av: Cheney, E. W.
Publicerad: (1966)

Intelligent Comparisons II: Operator Inequalities and Approximations
av: Anastassiou, George A.
Publicerad: (2020)

Granular Computing in Decision Approximation
av: Polkowski, Lech, et al.
Publicerad: (2015)

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

Algorithms and Complexity. 1st ed. 2017
av: Fotakis, Dimitris, et al.
Publicerad: (2020)

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

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

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

Mathematical Analysis I: Approximation Theory
av: Deo, Naokant, et al.
Publicerad: (2020)

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

Harmony Search Algorithm
av: Ser, Javier Del
Publicerad: (2020)

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

Complexity of Constraints
Publicerad: (2020)

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

Algorithms and Applications
av: Das, Sajal K., et al.
Publicerad: (2020)

Algorithms and Computation
av: Tokuyama, Takeshi
Publicerad: (2020)