706 search results - page 11 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
IPCO
1993
13 years 8 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
TCAD
2008
13 years 7 months ago
2008
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
ICMCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Action detection was formulated as a subvolume mutual information maximization problem in [8], where each subvolume identifies where and when the action occurs in the video. Desp...
ALGORITHMICA
2010
13 years 5 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
TCS
2008
13 years 7 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...