4843 search results - page 486 / 969 » The Shortcut Problem - Complexity and Approximation |
198
click to vote
SODA
2010
ACM
16 years 4 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...
169
click to vote
TIT
1998
15 years 6 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...
221
click to vote
INFOCOM
2007
IEEE
16 years 1 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...
178
click to vote
FOCS
2003
IEEE
16 years 5 days 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, ...
218
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...