Sciweavers

870 search results - page 54 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 1 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
IJPP
2008
74views more  IJPP 2008»
14 years 9 months ago
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
FOCS
2006
IEEE
15 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
ICALP
2005
Springer
15 years 3 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
CDC
2008
IEEE
110views Control Systems» more  CDC 2008»
14 years 11 months ago
Topological identification in networks of dynamical systems
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
Donatello Materassi, Giacomo Innocenti