Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Survey of local algorithms
A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …
Heuristics based on mathematical programming
This paper provides a survey of heuristics that make use of mathematical programming
models and methods. The first class of methods covered break down a problem into a …
models and methods. The first class of methods covered break down a problem into a …
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
We present randomized approximation algorithms for the maximum cut (MAX CUT) and
maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected …
maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected …
[کتاب][B] Approximation algorithms
VV Vazirani - 2001 - Springer
Although this may seem a paradox, all exact science is dominated by the idea of
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …
[کتاب][B] Combinatorial optimization
BH Korte, J Vygen, B Korte, J Vygen - 2011 - Springer
Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …
circuit boards. Since it produces many of these boards it wants the machine to complete one …
[کتاب][B] The design of approximation algorithms
DP Williamson, DB Shmoys - 2011 - books.google.com
Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …
planning (scheduling, facility location and network design); to computer science databases; …
[کتاب][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Almost optimal set covers in finite VC-dimension: (preliminary version)
We give a deterministic polynomial time method for finding a set cover in a set system (X, ℜ)
of VC-dimension d such that the size of our cover is at most a factor of O (d log (dc)) from the …
of VC-dimension d such that the size of our cover is at most a factor of O (d log (dc)) from the …
A simple effective heuristic for embedded mixed-integer quadratic programming
In this paper, we propose a fast optimisation algorithm for approximately minimising convex
quadratic functions over the intersection of affine and separable constraints (ie the Cartesian …
quadratic functions over the intersection of affine and separable constraints (ie the Cartesian …
Pipage rounding: A new method of constructing algorithms with proven performance guarantee
The paper presents a general method of designing constant-factor approximation algorithms
for some discrete optimization problems with assignment-type constraints. The core of the …
for some discrete optimization problems with assignment-type constraints. The core of the …