Sciweavers

983 search results - page 2 / 197
» Negative-Weight Cycle Algorithms
Sort
View
ADHOCNETS
2010
Springer
13 years 2 months ago
DCLA: A Duty-Cycle Learning Algorithm for IEEE 802.15.4 Beacon-Enabled WSNs
The current specification for IEEE 802.15.4 beacon-enabled networks does not define how active and sleep schedules should be configured in order to achieve the optimal network perf...
Rodolfo de Paz Alberola, Dirk Pesch
CORR
2006
Springer
164views Education» more  CORR 2006»
13 years 5 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
ICC
2007
IEEE
123views Communications» more  ICC 2007»
13 years 11 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 7 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
COCO
2010
Springer
131views Algorithms» more  COCO 2010»
13 years 2 months ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang