Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The 1-Neighbour Knapsack Problem

From MaRDI portal
Publication:3111641
Jump to:navigation, search

DOI10.1007/978-3-642-25011-8_6zbMath1314.90068OpenAlexW964508389MaRDI QIDQ3111641

Gordon Wilfong, Glencora Borradaile, Brent Heeringa

Publication date: 13 January 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_6



Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)


Related Items (2)

The knapsack problem with special neighbor constraints ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items




This page was built for publication: The 1-Neighbour Knapsack Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3111641&oldid=16186055"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki