791 search results - page 93 / 159 » Approximating the Maximum Sharing Problem |
120
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
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...
123
Voted
ICDCN
2009
Springer
15 years 7 months ago
2009
Springer
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...
158
Voted
ICIP
1999
IEEE
15 years 7 months ago
1999
IEEE
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...
165
Voted
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
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 ...
152
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
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...