447 search results - page 50 / 90 » Approximation Algorithms for Directed Steiner Problems |
124
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
121
click to vote
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
132
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
139
click to vote
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
132
click to vote
SIGECOM
2009
ACM
15 years 7 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...