100 search results - page 1 / 20 » New complexity results for time-constrained dynamical optima... |
JGAA
2010
13 years 9 months ago
2010
SPAA
1999
ACM
14 years 3 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
POPL
2003
ACM
14 years 11 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
NETWORKS
2008
13 years 10 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...