752 search results - page 106 / 151 » Faster approximation algorithms for the minimum latency prob... |
140
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
115
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
125
click to vote
SECON
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
135
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
143
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...