Sciweavers

Share
CORR
2007
Springer
134views Education» more  CORR 2007»
9 years 9 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
EPS
1998
Springer
10 years 1 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
ICNP
2002
IEEE
10 years 2 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
10 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
books