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

The set covering problem SCP is an NP-complete problem that has many important industrial applications. Since industrial…

2014

This work focus upon the first one, which, due to its high computational cost that causes us to obtain exact solutions, the use…

2011

The distal regions of the lower limbs, including the lower third of the legs and feet, are very prone to soft tissue loss due to…

2009

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

2009

We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like…

2005

In multi-protocol label switching (MPLS) networks, traffic demands can be routed along tunnels called label switched paths (LSPs…

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…