Sciweavers

1162 search results - page 97 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
WCNC
2008
IEEE
14 years 2 months ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 16 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
HSNMC
2003
Springer
102views Multimedia» more  HSNMC 2003»
14 years 1 months ago
A RTT-based Partitioning Algorithm for a Multi-rate Reliable Multicast Protocol
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
Moufida Maimour, CongDuc Pham
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 21 hour ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
DISOPT
2010
129views more  DISOPT 2010»
13 years 8 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...