Knapsack: connectedness, path, and shortest-path
From MaRDI portal
Publication:6547953
DOI10.1007/978-3-031-55601-2_11MaRDI QIDQ6547953
Sudeshna Kolay, Sipra Singh, Palash Dey
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- Approximability of partitioning graphs with supply and demand
- A faster parameterized algorithm for pseudoforest deletion
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Approximation of knapsack problems with conflict and forcing graphs
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- The knapsack problem with special neighbor constraints
- A new approach on locally checkable problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- On the thinness and proper thinness of a graph
- The stable set problem and the thinness of a graph
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- The Knapsack Problem with Conflict Graphs
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Parameterized Algorithms
This page was built for publication: Knapsack: connectedness, path, and shortest-path
