Sciweavers

432 search results - page 56 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
COCOON
2003
Springer
14 years 24 days ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
COCOON
2006
Springer
13 years 11 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...
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 9 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 7 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
TSP
2008
113views more  TSP 2008»
13 years 7 months ago
Covariance Matrix Estimation With Heterogeneous Samples
We consider the problem of estimating the covariance matrix of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly ...
Olivier Besson, Stéphanie Bidon, Jean-Yves ...