Sciweavers

21 search results - page 3 / 5
» jco 2010
Sort
View
JCO
2010
169views more  JCO 2010»
13 years 4 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
JCO
2010
90views more  JCO 2010»
13 years 4 months ago
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s ...
Geng-sheng Zhang, Yu-qin Yang
JCO
2010
70views more  JCO 2010»
13 years 4 months ago
Worst-case analysis for on-line service policies
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...
Zhenbo Wang, Wenxun Xing
JCO
2010
97views more  JCO 2010»
13 years 4 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
JCO
2010
82views more  JCO 2010»
13 years 4 months ago
Embedded paths and cycles in faulty hypercubes
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...
Nelson Castañeda, Ivan S. Gotchev