Sciweavers

356 search results - page 9 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 2 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
IPL
2006
70views more  IPL 2006»
13 years 7 months ago
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...
Kang Li, Lusheng Wang
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
13 years 8 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
LATIN
2000
Springer
13 years 11 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
14 years 28 days ago
Approximation Schemes for Broadcasting in Heterogenous Networks
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger