Sciweavers

COCOON
2006
Springer
14 years 26 days ago
Creation and Growth of Components in a Random Hypergraph Process
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
Vlady Ravelomanana, Alphonse Laza Rijamamy
COCOON
2006
Springer
14 years 26 days ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...
COCOON
2006
Springer
14 years 2 months ago
Improved On-Line Broadcast Scheduling with Deadlines
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, F...
COCOON
2006
Springer
14 years 2 months ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa
COCOON
2006
Springer
14 years 2 months ago
Improved Algorithms for the Minmax Regret 1-Median Problem
Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
COCOON
2006
Springer
14 years 2 months ago
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
Sheung-Hung Poon
COCOON
2006
Springer
14 years 2 months ago
Finding Patterns with Variable Length Gaps or Don't Cares
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
COCOON
2006
Springer
14 years 2 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
COCOON
2006
Springer
14 years 2 months ago
Optimal Acyclic Edge Colouring of Grid Like Graphs
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Rahul Muthu, N. Narayanan, C. R. Subramanian
COCOON
2006
Springer
14 years 2 months ago
The Unpredictable Deviousness of Models
Franco P. Preparata