COMPGEOM
2008
ACM
14 years 1 months ago
2008
ACM
COMPGEOM
2008
ACM
14 years 1 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
COMPGEOM
2008
ACM
14 years 1 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
COMPGEOM
2008
ACM
14 years 1 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
COCOA
2008
Springer
14 years 1 months ago
2008
Springer
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
COCOA
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
COCOA
2008
Springer
14 years 1 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
COCOA
2008
Springer
14 years 1 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
COCOA
2008
Springer
14 years 1 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
COCOA
2008
Springer
14 years 1 months ago
2008
Springer