Results 1  10
of
94,084
A Simple Approximation Algorithm in. . .
, 1996
"... We describe a very simple and efficient new algorithm for the approximation of complex numbers by algebraic integers in Z[e 2i=8 ] whose coeffcients with respect to the usual basis are bounded in absolute value by a given integer M . Its main idea is the use of a novel signature technique. An impo ..."
Abstract
 Add to MetaCart
We describe a very simple and efficient new algorithm for the approximation of complex numbers by algebraic integers in Z[e 2i=8 ] whose coeffcients with respect to the usual basis are bounded in absolute value by a given integer M . Its main idea is the use of a novel signature technique
A Simple Approximation Algorithm for the Weighted Matching Problem
 Information Processing Letters
, 2003
"... We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7]. ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7].
Simple Approximation Algorithm for Nonoverlapping Local Alignments
"... this paper will show how to implement this algorithm in O(N log N) time ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
this paper will show how to implement this algorithm in O(N log N) time
A Simple Approximation Algorithm for the Design of Tree Networks
, 2003
"... We present a simple 4approximation algorithm for the extensivelystudied Capacitated Minimum Spanning Tree problem. The approximation ratio of our algorithm matches the current best ratio of 4, due to Altinkemer and Gavish. Our algorithm is simpler, and easier to analyze when compared to the cur ..."
Abstract
 Add to MetaCart
We present a simple 4approximation algorithm for the extensivelystudied Capacitated Minimum Spanning Tree problem. The approximation ratio of our algorithm matches the current best ratio of 4, due to Altinkemer and Gavish. Our algorithm is simpler, and easier to analyze when compared
Simple Approximation Algorithms and PTASs for Various Problems in Wireless Ad Hoc Networks
, 2005
"... A wireless ad hoc network is often composed of a set V of n wireless devices distributed in a twodimensional domain. For each wireless device (also called node) u ∈ V, there is a transmission region within which signaltonoiseratio (SNR) is at least a threshold γ so that the signal transmitted by ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
with attention to interferencefree channel assignment or scheduling. Then we propose some simple approximation algorithms and/or PTASs (polynomial time approximation scheme) to approximate several classical graph problems such as maximum independent set, minimum vertex cover and minimum vertex coloring
Fast Approximation of Convex Hull 1 Simple Approximation Algorithm
"... We consider only the 2D case, although the generalization to higher dimension would be possible. Assume we are given a finite set A of 2D points. Let us denote CH(A) as the (accurate) convex hull of A and suppose that CH(A) contains the origin1. It is well known that CH(A) is the intersection of all ..."
Abstract
 Add to MetaCart
of all halfspaces containing A. The first idea to approximate the convex hull, inspired by kDOP bounding volumes [1], is to restrict the set of intersected halfspaces. In particular, we confine ourselves to k halfspaces defined as follows. Let angle α = 2π k. We can partition the plane to sectors
A Simple Approximation Algorithm for Computing ArrowDebreu Prices
, 2012
"... We consider the ArrowDebreu market with linear utilities in which there is a set G of divisible goods and a set B of buyers. Each buyer starts with an initial endowment of goods. The buyer’s utility function is a linearly separable function of the goods that the buyer purchases. We develop a simple ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
simple and efficient algorithm for determining an approximate market equilibrium. Our algorithm finds an �approximate solution in O�n/���B��G�� � time, where n = �B � + �G�. The running time can be further improved to O�n/��m + �B � log �B�� � where m is the number of pairs �i � j � such that buyer i
A Simple Approximation Algorithm in Z[e 2pi i/8 ]
, 1996
"... . We describe a very simple and efficient new algorithm for the approximation of complex numbers by algebraic integers in Z[e 2ßi=8 ] whose coefficients with respect to the usual basis are bounded in absolute value by a given integer M . Its main idea is the use of a novel signature technique. An ..."
Abstract
 Add to MetaCart
. We describe a very simple and efficient new algorithm for the approximation of complex numbers by algebraic integers in Z[e 2ßi=8 ] whose coefficients with respect to the usual basis are bounded in absolute value by a given integer M . Its main idea is the use of a novel signature technique
Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links
"... Abstract—Finding a maximumweighted independent set of links is a fundamental problem in wireless networking and has broad applications in various wireless link scheduling problems. Under protocol interference model, it is NPhard even when all nodes have uniform (and fixed) interference radii and t ..."
Abstract
 Add to MetaCart
and the positions of all nodes are available. On one hand, it admits a polynomialtime approximation scheme (PTAS). In other words, for any fixed
Results 1  10
of
94,084