129
click to vote
CPM
15 years 3 months ago
2004 Springer 
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
117
click to vote
COCOON
15 years 1 months ago
2004 Springer 
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
114
click to vote
COCOON
15 years 3 months ago
2004 Springer 
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
101
click to vote
CPM
15 years 3 months ago
2004 Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
CPM
15 years 1 months ago
2004 Springer 
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
|
Combinatorics