Approximation algorithms for NMR spectral peak assignment
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for NMR spectral peak assignment
We study a constrained bipartite matching problem where the input is a weighted bipartite graph G = (U, V,E), U is a set of vertices following a sequential order, V is another set of vertices partitioned into a collection of disjoint subsets, each following a sequential order, and E is a set of edges between U and V with non-negative weights. The objective is to find a matching in G with the ma...
متن کاملBetter Approximation Algorithms for NMR Spectral Peak Assignment
We study a constrained bipartite matching problem where the input is a weighted bipartite graph G = (U, V,E), U is a set of vertices following a sequential order, V is another set of vertices partitioned into a collection of disjoint subsets, each following a sequential order, and E is a set of edges between U and V with non-negative weights. The objective is to find a matching in G with the ma...
متن کاملImproved algorithms for 2-interval scheduling and NMR spectral peak assignment
We consider the 2-interval scheduling problem (2-ISP) defined as follows. We are given a discrete time interval I and a set J of jobs to be executed on a single machine during I. Each job v ∈ J requires either one or two contiguous time units of I and has a profit w(v, t) if v is started at time point t of I. Our goal is to maximize the total profit of the executed jobs. It has been recently sh...
متن کاملApproximation Algorithms for Wavelength Assignment
Winkler and Zhang introduced the FIBER MINIMIZATION problem in [3]. They showed that the problem is NP-complete but left the question of approximation algorithms open. We give a simple 2-approximation algorithm for this problem. We also show how ideas from the Dynamic Storage Allocation algorithm of Buchsbaum et al [1] can be used to give an approximation ratio arbitrarily close to 1 provided t...
متن کاملApproximation Algorithms for Generalized Assignment Problems
We consider a class of max-profit scheduling problems that occur naturally in many different applications, all involving assignment of jobs to multiple resources under a set of constraints. In the Max-Profit Generalized Assignment Problem (Max-GAP), we are given a set J of m bins (knapsacks), and a set I of n items. Each bin j ∈ J has capacity c(j). Each item i ∈ I has in bin j size `(i, j) and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00086-5