2796 search results - page 293 / 560 » The coolest path problem |
212
click to vote
CPAIOR
2007
Springer
16 years 24 days 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...
190
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
178
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
177
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
221
click to vote
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
Due to the recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the dr...