4894 search results - page 497 / 979 » The Guarding Problem - Complexity and Approximation |
176
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
165
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
139
click to vote
TIT
1998
15 years 4 months ago
1998
—The emergent role of information theory in image formation is surveyed. Unlike the subject of information-theoretic communication theory, information-theoretic imaging is far fr...
173
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
145
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...