6 citations · 9 across the 13 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.OC2024
A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem
Dorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt +1
The Quadratic Knapsack Problem (QKP) involves selecting a subset of elements that maximizes the sum of pairwise and singleton utilities without exceeding a given budget. The pairwi…
cs.DS2024
Binary weights spanning trees and the -red spanning tree problem in linear time
Dorit S. Hochbaum
We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when…