Efficient Randomized Algorithm for a Vector Subset Problem

DOI10.1007/978-3-319-44914-2_12zbMath1380.68436OpenAlexW2557632260MaRDI QIDQ3133208

I. A. Rykov, E. Kh. Gimadi

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_12

zbMATH Keywords

performance guaranteesrandomized algorithmasymptotically exact algorithmvector subset

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Complexity and approximation of finding the longest vector sum ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems

This page was built for publication: Efficient Randomized Algorithm for a Vector Subset Problem