Sciweavers

274 search results - page 37 / 55
» The Polymatroid Steiner Problems
Sort
View
110
Voted
DMGT
2011
94views more  DMGT 2011»
14 years 4 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
INFOCOM
2010
IEEE
14 years 11 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
82
Voted
STOC
2004
ACM
76views Algorithms» more  STOC 2004»
16 years 1 months ago
Isotopic implicit surface meshing
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
Jean-Daniel Boissonnat, David Cohen-Steiner, Gert ...
103
Voted
ICCAD
1998
IEEE
81views Hardware» more  ICCAD 1998»
15 years 5 months ago
A simultaneous routing tree construction and fanout optimization algorithm
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
Amir H. Salek, Jinan Lou, Massoud Pedram
123
Voted
DAC
1998
ACM
15 years 5 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong