Sciweavers

491 search results - page 43 / 99
» On cyclically orientable graphs
Sort
View
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
14 years 2 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
AAAI
2007
13 years 10 months ago
A Planning Approach for Message-Oriented Semantic Web Service Composition
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
Zhen Liu, Anand Ranganathan, Anton Riabov
FOCS
2006
IEEE
14 years 2 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
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 6 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
ICWE
2007
Springer
14 years 2 months ago
Model Transformation for Service-Oriented Web Applications Development
In recent years, innovation in technologies such as web services, business process automation, etc., have motivated a new paradigm in the application development field to appear, k...
Valeria de Castro, Juan M. Vara, Esperanza Marcos