743 search results - page 131 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
137
Voted
MDM
2009
Springer
15 years 8 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
111
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
185
click to vote
MFCS
2010
Springer
15 years 17 days ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
144
click to vote
HICSS
2008
IEEE
15 years 2 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
2010
Eurographics
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...