Randomized rounding

Within computer science and operations research,many combinatorial optimization problems are computationally intractable to solve exactly (to…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2016

Review

2016

A system level view of cellular processes for human and several organisms can be cap- tured by analyzing molecular interaction…

2015

In [21], Peikert presents an efficient and provably secure set of lower level primitives for practical post-quantum cryptography…

2012

This paper considers the capacitated multi-level lot-sizing problem with setup times, a class of difficult problems often faced…

2010

Particle Swarm Optimization (PSO) is a new paradigm of Swarm Intelligence which proposes that the co-operation of individuals…

2009

We consider the problem of generating randomized roundings that satisfy a single cardinality constraint and admit Chernoff-type…

2007

Ant algorithms are a recently developed, population- based approach which has been successfully applied to several NP-hard…

2006

2003

Association mining explores algorithms capable of detecting frequently co-occurring items in transactions. A transaction can be…

1986

This thesis deals with the approximate solution of a class of zero-one integer programs arising in the design of integrated…

1955

In a recent paper Stiefel presented a method designed for a high speed computer, for solving simultaneous linear algebraic…