Algorithm design

MaRDI QIDQ6906466zbMATH OpenFDO

Authors Jon M. Kleinberg, Éva Tardos

Publication date 4 November 2025

Full work available at URL https://dl.acm.org/doi/10.5555/1051910

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithms in computer science (68Wxx)

Cited in

(13)

• The online piercing set problem with recourse
• Minimum membership geometric set cover in the continuous setting
• Detecting differential item functioning across multiple groups using group pairwise penalty
• Simplification of forest classifiers and regressors by sharing branching conditions
• Coclique level structure for stochastic chemical reaction networks
• Geometric matching and bottleneck problems
• Complexity classes for online problems with and without predictions
• A lower bound for the quickhull convex hull algorithm that disproves the quickhull precision conjecture
• Polymorphic dynamic programming by algebraic shortcut fusion
• Online linear optimization with sparsity constraints
• Sharp bounds and characterizations for cut-component numbers of graphs
• Improving the location of facilities through network addition modification: a revisit
• On the complexity of knapsack under explorable uncertainty: hardness and algorithms

This page was built for publication: Algorithm design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906466)