Results 1  10
of
53,633
Polynomial time approximation algorithms for machine scheduling: Ten open problems
 Journal of Scheduling
, 1999
"... We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NPhard deterministic machine scheduling
problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature.
..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NPhard deterministic machine scheduling
problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature.
Polynomial Time Approximation Algorithms for Localization based on Unknown Signals
"... Abstract. We consider the problem of anchorfree selfcalibration of receiver locations using only the reception time of signals produced at unknown locations and time points. In our settings the receivers are synchronized, so the time differences of arrival (TDOA) of the signals arriving at the re ..."
Abstract
 Add to MetaCart
at the receivers can be calculated. Given the set of distinguishable time points for all receivers the task is to determine the positions of the receivers as well as the signal sources. We present the first polynomial time approximation algorithms for the minimum problem in the plane, in which the number
A PolynomialTime Approximation Algorithm for Joint Probabilistic Data Association
, 2005
"... Joint probabilistic data association (JPDA) is a powerful tool for solving data association problems. However, the exact computation of association probabilities {βjk} in JPDA is NPhard, where βjk is the probability that jth observation is from kth track. Hence, we cannot expect to compute associ ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
association probabilities in JPDA exactly in polynomial time unless P = NP. In this paper, we present a simple Markov chain Monte Carlo data association (MCMCDA) algorithm that finds an approximate solution to JPDA in polynomial time. For ɛ> 0 and 0 < η <.5, we prove that the algorithm finds good
A POLYNOMIALTIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
 JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
, 2006
"... We consider the following packing problem. Let α be a fixed real in (0, 1]. We are given a bounding rectangle ρ and a set R of n possibly intersecting unit disks whose centers lie in ρ. The task is to pack a set B of m disjoint disks of radius α into ρ such that no disk in B intersects a disk in R, ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
, where m is the maximum number of unit disks that can be packed. In this paper we present a polynomialtime algorithm for α = 2/3. So far only the case of packing squares has been considered. For that case, Baur and Fekete have given a polynomialtime algorithm for α = 2/3 and have shown that the problem
A polynomialtime approximation algorithm for the number of kmatchings in bipartite graphs
, 2006
"... We show that the number of kmatching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided by a suitable factor. If G is bipartite then one can construct a bipartite Gk. For bipartite graphs this result implies ..."
Abstract
 Add to MetaCart
that the number of kmatching has a polynomialtime approximation algorithm. The above results are extended to permanents and hafnians of corresponding matrices.
A polynomialtime approximation algorithm for the number of kmatchings in bipartite graphs
, 2006
"... ..."
A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with NonNegative Entries
 JOURNAL OF THE ACM
, 2004
"... We present a polynomialtime randomized algorithm for estimating the permanent of an arbitrary n ×n matrix with nonnegative entries. This algorithm—technically a “fullypolynomial randomized approximation scheme”—computes an approximation that is, with high probability, within arbitrarily small spec ..."
Abstract

Cited by 427 (27 self)
 Add to MetaCart
We present a polynomialtime randomized algorithm for estimating the permanent of an arbitrary n ×n matrix with nonnegative entries. This algorithm—technically a “fullypolynomial randomized approximation scheme”—computes an approximation that is, with high probability, within arbitrarily small
Polynomial Time Approximation Algorithms for MultiConstrained QoS Routing
"... We study the multiconstrained QualityofService (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K ≥ 2 additive QoS constraints. Specifically we consider an optimization version of the problem called the OMCP problem which is defined as follo ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
such that max2≤k≤K ω k(π) W k is minimized, subject to the constraint that ω1(π) ≤ W1. We present an O(mn log log log n + mn/ɛ) time (1 + ɛ)(K − 1)approximation algorithm and an O(mn log log log n+m ( n ɛ)K−1) time (1 + ɛ)approximation algorithm, for any ɛ> 0, where n = V  and m = E. For the case of K
A Polynomial Time Approximation Algorithm for the TwoCommodity Splittable Flow Problem
"... ar ..."
MULTICONSTRAINED QOS ROUTING 1 Polynomial Time Approximation Algorithms for MultiConstrained QoS Routing
"... Abstract — We study the multiconstrained QualityofService (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K ≥ 2 additive endtoend QoS constraints. This problem is NPhard and is commonly modeled using a graph with n vertices and m edges wit ..."
Abstract
 Add to MetaCart
with K additive QoS parameters associated with each edge. For the case of K = 2, the problem has been well studied, with several provably good polynomial time approximation algorithms reported in the literature, which enforce one constraint while approximating the other. We first focus on an optimization
Results 1  10
of
53,633