1707 search results - page 164 / 342 » Early Integer Programming |
131
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
149
click to vote
TON
2012
13 years 4 months ago
2012
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
126
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
251
Voted
POPL
2001
ACM
16 years 2 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
165
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...