406 search results - page 46 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
100
click to vote
STOC
2009
ACM
16 years 12 days ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
105
click to vote
WWW
2009
ACM
16 years 14 days ago
2009
ACM
Anycast-based content delivery networks (CDNs) have many properties that make them ideal for the large scale distribution of content on the Internet. However, because routing chan...
JAIR
2008
14 years 11 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representa...