Results 1  10
of
49
NodeDisjoint Paths on the Mesh and a New TradeOff in VLSI Layout
, 1996
"... A number of basic models for VLSI layout are based on the construction of nodedisjoint paths between terminals on a multilayer grid. In this setting, one is interested in minimizing both the number of layers required and the area of the underlying grid. Building on work of Cutler and Shiloach, and ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
, and Aggarwal, Klawe, et al., we prove an upperbound tradeoff between these two quantities in a general multilayer grid model. As a special case of our main result, we obtain significantly improved bounds for the problem of routing a full permutation on the mesh using nodedisjoint paths; our new bound here
An Iterative Stripification Algorithm Based on Dual Graph Operations
 IN PROCEEDINGS OF EUROGRAPHICS 2003 (SHORT PRESENTATIONS
, 2003
"... This paper describes the preliminary results obtained using an iterative method for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange and decre ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
This paper describes the preliminary results obtained using an iterative method for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange
ContextDriven Automatic Subgraph Creation for LiteratureBased Discovery
"... Background: Literaturebased discovery (LBD) is characterized by uncovering hidden associations in noninteracting scientific literature. Prior approaches to LBD include use of: 1) domain expertise and structured background knowledge to manually filter and explore the literature, 2) distributional s ..."
Abstract
 Add to MetaCart
: To generate subgraphs, the set of all MEDLINE articles that contain either of two specified concepts (A, C) are first collected. Binary relationships or assertions, which are automatically extracted from the MEDLINE articles, called semantic predications, are then used to create a labeled directed
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for pointtopoint routing, but ..."
Abstract
 Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for pointtopoint routing
An improved algorithm for bipartite correlation clustering. European Symposium on Algorithms
, 2011
"... Bipartite Correlation clustering is the problem of generating a set of disjoint bicliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained in any way. The best known approximation algorithm for this ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Bipartite Correlation clustering is the problem of generating a set of disjoint bicliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained in any way. The best known approximation algorithm
A note on rooted survivable networks
 IPL
, 2009
"... The (undirected) Rooted Survivable Network Design (Rooted SND) problem is: given a complete graph on node set V with edgecosts, a root s ∈ V, and (node)connectivity requirements {r(t) : t ∈ T ⊆ V}, find a minimum cost subgraph G that contains r(t) internallydisjoint stpaths for all t ∈ T. For la ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The (undirected) Rooted Survivable Network Design (Rooted SND) problem is: given a complete graph on node set V with edgecosts, a root s ∈ V, and (node)connectivity requirements {r(t) : t ∈ T ⊆ V}, find a minimum cost subgraph G that contains r(t) internallydisjoint stpaths for all t ∈ T
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family... Résumé ..."
Remotespanners: What to know beyond neighbors
, 2008
"... Motivated by the fact that neighbors are generally known in practical routing algorithms, we introduce the notion of remotespanner. Given an unweighted graph G, a subgraph H with vertex set V (H) = V (G) is an (α, β)remotespanner if for each pair of points u and v the distance between u and v i ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Motivated by the fact that neighbors are generally known in practical routing algorithms, we introduce the notion of remotespanner. Given an unweighted graph G, a subgraph H with vertex set V (H) = V (G) is an (α, β)remotespanner if for each pair of points u and v the distance between u and v
PrizeCollecting Steiner Network Problems
"... In the Steiner Network problem we are given a graph G with edgecosts and connectivity requirements ruv between node pairs u, v. The goal is to find a minimumcost subgraph H of G that contains ruv edgedisjoint paths for all u, v ∈ V. In PrizeCollecting Steiner Network problems we do not need to ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
In the Steiner Network problem we are given a graph G with edgecosts and connectivity requirements ruv between node pairs u, v. The goal is to find a minimumcost subgraph H of G that contains ruv edgedisjoint paths for all u, v ∈ V. In PrizeCollecting Steiner Network problems we do not need
ative Commons Attribution NonCommercial No Derivatives licence. Researchers
"... I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged. ..."
Abstract
 Add to MetaCart
I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged.
Results 1  10
of
49