Stack Overflow
Stack Overflow

Questions tagged [approximation]

Approximation algorithms are algorithms used to find approximate solutions to optimization problems.

Approximation algorithms are algorithms which generate feasible solutions to optimizazion algorithms. Although permitted to generate solution which are not optimal, there is an algorithm-dependent bound for the ratio of the objective of an optimum and the objective of the generated solution; this ratio is termed the approximation ratio.

Useful links

Related tags

523 questions
0
votes
0 answers

Applying maximum bipartite algorithm on text file containing graph info and produce graph(with max matching) as output

I want to read text file containing graph information and apply approximation on graph. Output would be graph containing maximum matching nodes information. Algorithm is based on maximum bipartite matching. I am using eclipse PyDev for this. Here…
rahmed
  • 1
  • 3
0
votes
0 answers

Approximate pi with rational numbers

The value of pi = 3.1415926535... can approximate pi with rational numbers like this: 22/7 = 3.142857142857... 355/113 = 3.141592920353... I want to construct more accurate fractions, so: Please tell me the fast algorithm of finding integers p, q…
square1001
  • 1,402
  • 11
  • 26
0
votes
2 answers

How to approximate a Poisson distribution $P(n,lambda)$

I have to implement an algorithm to evaluate a sum of poisson functions, each one with multiplying constants: Where C(k) are positive constants<1, cut is a cutoff because in principle the sum should take infinite numbers of k, and lambda is a…
Francesco Di Lauro
  • 618
  • 7
  • 22
0
votes
0 answers

2 approximation for minimization problems

I have a general question, I know there is a way to find 2-approximation for maximization problems by finding 2 solution s1 and s2 s.t q(s1)+q(s2)>=q(OPT) and by chosing max{q(s1),q(s2)} i've found a legit approx. Back to my question, Is it…
limitless
  • 669
  • 7
  • 18
0
votes
3 answers

Efficient approximation of rotation

I am trying to write an algorithm that rotates one square around its centre in 2D until it matches or is "close enough" to the rotated square which started in the same position, is the same size and has the same centre. Which is fairly easy. However…
John Traynor
  • 13
  • 3
0
votes
1 answer

Hitting Set algorithm approximation

I want to solve the problem below from a textbook I am reading, but I am not sure how to go about it. In fact I am not sure if it is correct at all since I think we would need the maximum frequency of an element in the sets and not the maximum size…
dearn44
  • 3,198
  • 4
  • 30
  • 63
0
votes
0 answers

2 Dimensional Knapscak algorithm

I am trying to get the algorithm(close to optimal) for a variant of 2 dimensional knapsack problem, below is the problem description. lets say we have n number of rectangle R1(l1,w1) R2(l2,w2)......Rn(ln,wn) and each with associated cost (cl1,cw1)…
user6385735
  • 151
  • 1
  • 10
0
votes
0 answers

Exact binomial test using binom.test and qbinom, pbinom?

The below methodology is for a one-sided test.I am trying to use the two methods for obtaining the p-value where it should be the same in case of Binomial hypothesis testing. But I am receiving a slight difference in the values. pi.H0 <- 0.65 n <-…
Rohit Venkat Gandhi Mendadhala
  • 193
  • 2
  • 11
0
votes
0 answers

LCS approximation with sparse alphabet in O(m+n)

In Longest Common sub-sequences problem, we have two string s1 and s2 with length m and n, we want to find the longest sub-sequence in both s1 and s2 which is not required to occupy consecutive positions within the original sequences. The common…
user137927
  • 347
  • 3
  • 13
0
votes
1 answer

Solving Least square using MATLAB

Assume we want to determine the coefficients of a polynomial equation that is approximating the tangent function between 0 to 1, as follow: -A is m×n vandermonde matrix. The entries are populated using m value between 0 to 11(given as input). -The…
Crimson
  • 157
  • 7
0
votes
0 answers

Finding approximation ratio of an algorithm

I am trying to find the solution of the traveling salesman problem using various techniques. I have tested my code for some sample data. The optimal solution is known. Now I want to find the approximation ratio of my algorithm. how will I do that?…
AAA
  • 87
  • 3
  • 9
0
votes
0 answers

Dividng a vector (with fewer elements) by another vector in MatLab

I have a vector N which has 21 elements N=[3900000 5300000 7200000 9600000 12900000 17100000 23100000 ... 31400000 38600000 50200000 62900000 76000000 92000000 ... 105700000 122800000 131700000 150700000 179000000 205000000 ... 226500000…
Justine Lawless
  • 1
0
votes
0 answers

How to show Metric TSP in APX set of algorithms

I know that Metric Travelling Salesman Problem is in the APX (approximable) set of algorithms, but I'm not sure how to show this? I have been researching about it a little bit and have heard that you can show that Metric TSP is in APX by giving a…
Barney Chambers
  • 2,720
  • 6
  • 42
  • 78
0
votes
1 answer

Can you help me to identify the rounding of this application?

I've a application that output chunk of buffers that represent 1/96 of beat (lets call them pulses), using a Sample Rate of 44100. At constant 120 BPM, I have 2 beat per second, so 22050 samples per beat, thus 229,6875 samples per pulse. These are…
markzzz
  • 47,390
  • 120
  • 299
  • 507
0
votes
1 answer

Representing array in Python as a continuous function

An array in python is a function of integers, namely arr[0],arr[1],arr[2]. Does there exist a function to represent array values as a continuous function?
tesgoe
  • 1,012
  • 3
  • 10
  • 19
1 2 3
…
34 35