Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,299,993 papers from all fields of science
Search
Sign In
Create Free Account
Randomized rounding
Within computer science and operations research,many combinatorial optimization problems are computationally intractable to solve exactly (to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Analysis of algorithms
Approximation algorithm
Combinatorial optimization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Inferring disease causing genes and their pathways: A mathematical perspective
Jeethu V. Devasia
,
P. Chandran
arXiv.org
2016
Corpus ID: 1982175
A system level view of cellular processes for human and several organisms can be cap- tured by analyzing molecular interaction…
Expand
2015
2015
An OR Practitioner's Solution Approach for the Set Covering Problem
Yun Lu
,
Francis J. Vasko
International Journal of Applied Metaheuristic…
2015
Corpus ID: 39751202
The set covering problem SCP is an NP-complete problem that has many important industrial applications. Since industrial…
Expand
2014
2014
Algoritmo GRASP para cortes de guillotina
María Elena Rivera
,
Edgar Ruiz Lizama
2014
Corpus ID: 109069041
This work focus upon the first one, which, due to its high computational cost that causes us to obtain exact solutions, the use…
Expand
2011
2011
Reverse-flow supramalleolar flap : clinical applications
J. C. Batista
2011
Corpus ID: 145027184
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…
Expand
2009
2009
Randomized Rounding in the Presence of a Cardinality Constraint
Benjamin Doerr
,
Magnus Wahlström
Workshop on Algorithm Engineering and…
2009
Corpus ID: 15262384
We consider the problem of generating randomized roundings that satisfy a single cardinality constraint and admit Chernoff-type…
Expand
2009
2009
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
M. Goemans
,
Nicholas J. A. Harvey
,
K. Jain
,
Mohit Singh
arXiv.org
2009
Corpus ID: 14410790
We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like…
Expand
2005
2005
A randomized rounding heuristic to reroute tunnels in MPLS networks
O. Klopfenstein
International Workshop on the Design of Reliable…
2005
Corpus ID: 26690609
In multi-protocol label switching (MPLS) networks, traffic demands can be routed along tunnels called label switched paths (LSPs…
Expand
2003
2003
Association Mining in Gradually Changing Domains
A. Rozsypal
,
M. Kubát
The Florida AI Research Society
2003
Corpus ID: 14495499
Association mining explores algorithms capable of detecting frequently co-occurring items in transactions. A transaction can be…
Expand
1986
1986
Randomized Rounding And Discrete Ham-Sandwich Theorems:
P. Raghavan
1986
Corpus ID: 124912926
This thesis deals with the approximate solution of a class of zero-one integer programs arising in the design of integrated…
Expand
1955
1955
The Solution of Linear Simultaneous Equations by Matrix Iteration
J. Guest
1955
Corpus ID: 119979968
In a recent paper Stiefel presented a method designed for a high speed computer, for solving simultaneous linear algebraic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE