296 search results - page 32 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
82
Voted
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
ICCCN
2008
IEEE
15 years 4 months ago
2008
IEEE
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
SODA
2012
ACM
13 years 2 days ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
MICCAI
2006
Springer
15 years 10 months ago
2006
Springer
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...