1963 search results - page 219 / 393 » The Maximum Solution Problem on Graphs |
SSDBM
1990
IEEE
15 years 4 months ago
1990
IEEE
In this paper we explore the structure and semantic properties of the entities stored in statistical databases. We call such entities "statistical objects" (SOS) and prop...
105
Voted
TRANSCI
2008
14 years 11 months ago
2008
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
108
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
96
Voted
CPM
2001
Springer
15 years 5 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
91
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...