scholarly journals C7.3 - Polynomial Time Approximation Algorithms for Localization based on Unknown Signals

2013 ◽  
Author(s):  
Ch. Schindelhauer ◽  
J. Wendeberg
Keyword(s):  
Approximation Algorithms ◽  
Polynomial Time ◽  
Time Approximation ◽  
Polynomial Time Approximation

APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS

2002 ◽  
Vol 13 (04) ◽  
pp. 613-627 ◽  
Author(s):  
RENAUD LEPÈRE ◽  
DENIS TRYSTRAM ◽  
GERHARD J. WOEGINGER
Keyword(s):  
Approximation Algorithms ◽  
Approximation Algorithm ◽  
Polynomial Time ◽  
Precedence Constraints ◽  
Performance Guarantee ◽  
Time Approximation ◽  
Polynomial Time Approximation Algorithm ◽  
Special Cases ◽  
Special Case ◽  
Polynomial Time Approximation

This work presents approximation algorithms for scheduling the tasks of a parallel application that are subject to precedence constraints. The considered tasks are malleable which means that they may be executed on a varying number of processors in parallel. The considered objective criterion is the makespan, i.e., the largest task completion time. We demonstrate a close relationship between this scheduling problem and one of its subproblems, the allotment problem. By exploiting this relationship, we design a polynomial time approximation algorithm with performance guarantee arbitrarily close to [Formula: see text] for the special case of series parallel precedence constraints and for the special case of precedence constraints of bounded width. These special cases cover the important situation of tree structured precedence constraints. For arbitrary precedence constraints, we give a polynomial time approximation algorithm with performance guarantee [Formula: see text].

ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM

1993 ◽  
Vol 04 (02) ◽  
pp. 117-133
Author(s):  
IAIN A. STEWART
Keyword(s):  
Approximation Algorithms ◽  
Polynomial Time ◽  
Optimization Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Deterministic Algorithm ◽  
Time Approximation ◽  
Nondeterministic Algorithm ◽  
Polynomial Time Approximation ◽  
Clique Problem

We look at well-known polynomial-time approximation algorithms for the optimization problem MAX-CLIQUE (“find the size of the largest clique in a graph”) with regard to how easy it is to compute the actual cliques yielded by these approximation algorithms. We show that even for two “pretty useless” deterministic polynomial-time approximation algorithms, it is unlikely that the resulting clique can be computed efficiently in parallel. We also show that for each non-deterministic algorithm, it is unlikely that there is some deterministic polynomial-time algorithm that decides whether any given vertex appears in some clique yielded by that nondeterministic algorithm.

Polynomial-Time Approximation Algorithms for the Ising Model

1993 ◽  
Vol 22 (5) ◽  
pp. 1087-1116 ◽  
Author(s):  
Mark Jerrum ◽  
Alistair Sinclair
Keyword(s):  
Ising Model ◽  
Approximation Algorithms ◽  
Polynomial Time ◽  
Time Approximation ◽  
Polynomial Time Approximation

scholarly journals On polynomial-time approximation algorithms for the variable length scheduling problem

2003 ◽  
Vol 302 (1-3) ◽  
pp. 489-495
Author(s):  
Artur Czumaj ◽  
Leszek Ga̧sieniec ◽  
Daya Ram Gaur ◽  
Ramesh Krishnamurti ◽  
Wojciech Rytter ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Polynomial Time ◽  
Variable Length ◽  
Scheduling Problem ◽  
Time Approximation ◽  
Polynomial Time Approximation
Sign in / Sign up

Export Citation Format

Share Document