We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Optical diffusion tomography attempts to reconstruct an object cross section from measurements of scattered and attenuated light. While Bayesian approaches are well suited to this...
Jong Chul Ye, Charles A. Bouman, Rick P. Millane, ...
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...