648 search results - page 10 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
ALGORITHMICA
2005
13 years 7 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
DOCENG
2006
ACM
14 years 1 months ago
2006
ACM
Category ranking provides a way to classify plain text documents into a pre-determined set of categories. This work proposes to have a look at typical document collections and ana...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
ICTAI
2003
IEEE
14 years 28 days ago
2003
IEEE
This paper presents a simple ¢¤£¦¥¨§© Evolution Strategy and three simple selection criteria to solve engineering optimization problems. This approach avoids the use of a...
ADHOCNETS
2009
Springer
14 years 2 months ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...