Sciweavers

2714 search results - page 31 / 543
» Approximation Schemes for Scheduling
Sort
View
78
Voted
JCAM
2010
90views more  JCAM 2010»
14 years 7 months ago
Approximation order of interpolatory nonlinear subdivision schemes
Linear interpolatory subdivision schemes of Cr smoothness have
Nira Dyn, Philipp Grohs, Johannes Wallner
113
Voted
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
15 years 1 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
93
Voted
SODA
2004
ACM
152views Algorithms» more  SODA 2004»
15 years 1 months ago
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
Artur Czumaj, Michelangelo Grigni, Papa Sissokho, ...
136
Voted
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 4 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
80
Voted
DAC
2009
ACM
16 years 1 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert