Sciweavers

AAIM
2007
Springer
103views Algorithms» more  AAIM 2007»
14 years 5 months ago
Strip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm...
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
14 years 5 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 5 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
14 years 5 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
AAIM
2007
Springer
115views Algorithms» more  AAIM 2007»
14 years 5 months ago
Optimal Order Allocation with Discount Pricing
Boris Goldengorin, John Keane, Viktor Kuzmenko, Mi...
AAIM
2007
Springer
94views Algorithms» more  AAIM 2007»
14 years 5 months ago
An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options
Abstract. Pricing arithmetic average options continues to intrigue researchers in the field of financial engineering. Since there is no analytical solution for this problem until...
Tian-Shyr Dai, Jr-Yan Wang, Hui-Shan Wei
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
14 years 5 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
14 years 5 months ago
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas
AAIM
2007
Springer
145views Algorithms» more  AAIM 2007»
14 years 5 months ago
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
Minghui Jiang
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
14 years 5 months ago
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Ruka Tanahashi