867 search results - page 95 / 174 » The Generalized Maximum Coverage Problem |
155
click to vote
GLOBECOM
2006
IEEE
16 years 6 days ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
139
click to vote
ASPDAC
2006
ACM
16 years 3 days ago
2006
ACM
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
137
Voted
ACSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
172
Voted
COLOGNETWENTE
2009
15 years 7 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
153
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...