Sciweavers

409 search results - page 30 / 82
» Polynomial Time Approximation Schemes and Parameterized Comp...
Sort
View
MOC
2010
14 years 4 months ago
Approximation of stationary statistical properties of dissipative dynamical systems: Time discretization
We consider temporal approximation of stationary statistical properties of dissipative complex dynamical systems. We demonstrate that stationary statistical properties of the time...
Xiaoming Wang
ICALP
2011
Springer
14 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 4 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
MOC
2000
97views more  MOC 2000»
14 years 9 months ago
Convergence rates to the discrete travelling wave for relaxation schemes
Abstract. This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating...
Hailiang Liu
COCOON
2005
Springer
15 years 3 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu