Search Sciweavers | Sciweavers

2252 search results - page 13 / 451

» Lower Bounds for Dynamic Algorithms

click to vote

NETWORKS
2006

111views Computer Networks» more NETWORKS 2006»

Lower bounds for the relative greedy algorithm for approximating Steiner trees

13 years 7 months ago

Download www.matheon.de

Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...

Stefan Hougardy, Stefan Kirchner

claim paper

Read More »

click to vote

ISPD
2004
ACM

189views Hardware» more ISPD 2004»

Almost optimum placement legalization by minimum cost flow and dynamic programming

14 years 29 days ago

Download www.eecs.tufts.edu

VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...

Ulrich Brenner, Anna Pauli, Jens Vygen

claim paper

Read More »

click to vote

CORR
2008
Springer

132views Education» more CORR 2008»

Betweenness Centrality : Algorithms and Lower Bounds

13 years 7 months ago

Download www.cc.gatech.edu

One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...

Shiva Kintali

claim paper

Read More »

click to vote

ICCV
2001
IEEE

196views Computer Vision» more ICCV 2001»

Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree

14 years 9 months ago

Download www.cs.nctu.edu.tw

Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh

claim paper

Read More »