2796 search results - page 223 / 560 » The coolest path problem |
208
click to vote
IPCO
2004
15 years 8 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
201
click to vote
DISOPT
2010
15 years 6 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...
161
click to vote
DM
2007
15 years 6 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
189
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
164
click to vote
NAACL
2007
15 years 8 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...