193 search results - page 18 / 39 » A Lower Bound for the Shortest Path Problem |
148
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
136
click to vote
DISOPT
2010
15 years 1 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
158
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
146
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
133
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...