Sciweavers

22 search results - page 4 / 5
» Properties of vertex cover obstructions
Sort
View
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
TALG
2008
93views more  TALG 2008»
14 years 11 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
ICPR
2008
IEEE
15 years 6 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...
FOCS
2009
IEEE
15 years 6 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 9 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...