![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Two Variations of the Minimum Steiner Problem
Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum tota...
-
Chapter and Conference Paper
Lower Bounds for Wide-Sense Non-blocking Clos Network
The 3-stage Clos network is generally considered the most basic multistage interconnecting network(MIN). The nonblocking property of such network has been extensively studied in the past. However there are only a...
-
Chapter and Conference Paper
Optimal algorithms for circle partitioning
Given a set of n points F on a circle and an integer k, we would like to find a size k subset of F such that these points are “evenly distributed” on the circle. We define two different criteria to capture the in...
-
Article
Fast algorithms for the dominating set problem on permutation graphs
AnO(n log logn) (resp.O(n2 log2 n)) algorithm is presented to solve the minimum cardinality (resp. weight) dominating set problem on permutation graphs, assuming the input is a permutation. The best-known previou...
-
Chapter and Conference Paper
Fast algorithms for the dominating set problem on permutation graphs