Knapsack Problems: A Parameterized Point of View

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2018.12.019
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Parameterized Inequalities About a Point in the Plane of a Triangle

Journal of Mathematical Inequalities
Analysis
2018English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Tolerance Analysis for 0–1 Knapsack Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Some Hard Families of Parameterized Counting Problems

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

Point of View

The Sciences
1974English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

From a Certain Point of View

Journal of Contemporary Ethnography
LinguisticsSociologyLanguageAnthropologyUrban StudiesPolitical Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy