434 search results - page 51 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
STOC
2004
ACM
16 years 2 days ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
106
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
105
click to vote
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
148
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
—Autonomous wireless agents such as unmanned aerial vehicles, mobile base stations, or self-operating wireless nodes present a great potential for deployment in next-generation w...
WEA
2007
Springer
15 years 5 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...