Sciweavers

3192 search results - page 138 / 639
» The minimum latency problem
Sort
View
IPPS
2009
IEEE
15 years 10 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
15 years 8 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan
129
Voted
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
15 years 5 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
ORL
2006
91views more  ORL 2006»
15 years 3 months ago
Resource augmentation in two-dimensional packing with orthogonal rotations
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
José R. Correa
154
Voted
COCOA
2009
Springer
15 years 10 months ago
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pen...