Join Our Newsletter

MOBIHOC

2012

ACM

10 years 5 months ago
2012

ACM

We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...

CORR

2011

Springer

11 years 10 months ago
2011

Springer

Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...

IPL

1998

12 years 3 months ago
1998

The k-MST problem requires ﬁnding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...

CATS

1998

12 years 4 months ago
1998

Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...

CCCG

2006

12 years 4 months ago
2006

We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.

IPCV

2008

12 years 4 months ago
2008

Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...

ASPDAC

2005

ACM

12 years 5 months ago
2005

ACM

— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...

LATIN

1995

Springer

12 years 6 months ago
1995

Springer

A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...

ICALP

2000

Springer

12 years 7 months ago
2000

Springer

We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...

ESA

2000

Springer

12 years 7 months ago
2000

Springer

Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...