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...
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...
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...
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...
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...