Sciweavers

406 search results - page 28 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 3 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
14 years 2 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
FLAIRS
2004
13 years 11 months ago
Backcalculation of Airport Flexible Pavement Non-Linear Moduli Using Artificial Neural Networks
The Heavy Weight Deflectometer (HWD) test is one of the most widely used tests for assessing the structural integrity of airport pavements in a non-destructive manner. The elastic...
Kasthurirangan Gopalakrishnan, Marshall R. Thompso...
FSTTCS
2004
Springer
14 years 3 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
ICALP
2011
Springer
13 years 1 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...