12519 search results - page 275 / 2504 » Approximation Problems Categories |
185
click to vote
SODA
1998
ACM
15 years 8 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...
166
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
145
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
184
click to vote
SIGPRO
2010
15 years 5 months ago
2010
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
167
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...