2446 search results - page 334 / 490 » Choiceless Polynomial Time |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
FOCM
2011
12 years 11 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...