1998 search results - page 259 / 400 » Complexity of the Cover Polynomial |
128
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
89
Voted
TSP
2010
14 years 7 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
138
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
108
click to vote
PODC
2005
ACM
15 years 6 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
138
click to vote
MST
2010
14 years 7 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...