Results 11  20
of
2,600,641
Efficient Approximation Algorithms for Floorplan Area Minimization
 DAC 96
, 1996
"... Approximation has been shown to be an effective method for reducing the time and space costs of solving various floorplan area minimization problems. In this paper, we present several approximation techniques for solving floorplan area minimization problems. These new techniques enable us to reduce ..."
Abstract
 Add to MetaCart
both the time and space complexities of the previously best known approximation algorithms by more than a factor of n and n² for rectangular and Lshaped subfloorplans, respectively (where n is the number of given implementations). The efficiency in the time and space complexities is critical
An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
, 2008
"... For many circuit design problems, it is imperative to carefully study the effect of physical implementation constraints. Under some circumstances, it is very difficult to fabricate wire crossings. In this paper, we introduce a crossing elimination model based on a node duplication method and we wan ..."
Abstract
 Add to MetaCart
want to minimize the number of duplication. We relate it with an artificial problem, called the maximum simple sharing problem. First we prove it is NPhard, then we show that a simple greedy algorithm can achieve an approximation factor of 3. We then introduce the maximum disjoint simple sharing
Efficient Approximation Algorithms for the Hamming Center Problem
"... The Hamming center problem for a set S of k binary strings, each of length n, is to find a binary string fl of length n that minimizes the maximum Hamming distance between p and any string in S. Its decision version is known to be NPcomplete [2]. We provide several approximation algorithms for t ..."
Abstract
 Add to MetaCart
The Hamming center problem for a set S of k binary strings, each of length n, is to find a binary string fl of length n that minimizes the maximum Hamming distance between p and any string in S. Its decision version is known to be NPcomplete [2]. We provide several approximation algorithms
Efficient approximation algorithms for minimum enclosing convex shapes
, 2009
"... We address the problem of Minimum Enclosing Ball (MEB) and its generalization to Minimum Enclosing Convex Polytope (MECP). Given n points in a d dimensional Euclidean space, we give a O(nd / √ ɛ) algorithm for producing an enclosing ball whose radius is at most ɛ away from the optimum. In the case ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We address the problem of Minimum Enclosing Ball (MEB) and its generalization to Minimum Enclosing Convex Polytope (MECP). Given n points in a d dimensional Euclidean space, we give a O(nd / √ ɛ) algorithm for producing an enclosing ball whose radius is at most ɛ away from the optimum. In the case
Efficient approximation algorithms for the economic lotsizing . . .
, 2014
"... We consider a continuoustime variant of the classical Economic LotSizing (ELS) problem. In this model, the setup cost is a continuous function with lower bound Kmin> 0, the demand and holding costs are integrable functions of time and the replenishment decisions are not restricted to be multipl ..."
Abstract
 Add to MetaCart
to be multiples of a base period. Starting from the assumption that certain operations involving the setup and holding cost functions can be carried out efficiently, we argue that this variant admits a simple approximation scheme based on dynamic programming: if the optimal cost of an instance is OPT, we can find
Efficient Approximation Algorithms for TwoLabel Point Labeling
 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
"... ..."
Abstract Efficient Approximation Algorithms for Scheduling Malleable Tasks
"... A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depending on the amount of resources allotted to it. According to the standard behavior of parallel applications, we assume that the malleable tasks are monotonic, i.e. that the e ..."
Abstract
 Add to MetaCart
, the scheduling problem is solved by a dualapproximation which leads to a simple structure of two consecutive shelves. 1
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
 Journal of Algorithms
, 1999
"... We give a new efficient approximation algorithm for scheduling precedence constrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j =s i units of time ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
We give a new efficient approximation algorithm for scheduling precedence constrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j =s i units
Research Article Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms
"... License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The integration of ontologies builds knowledge structures which brings new understanding on existing terminologies and their associations. With the steady increase in ..."
Abstract
 Add to MetaCart
with hierarchical structures. We identified optimal structures in this problem and proposed optimal and efficient approximation algorithms for integrating a pair of ontologies. Furthermore, we extend the basic problem to address the integration of a large number of ontologies, and correspondingly we proposed
Results 11  20
of
2,600,641