Sciweavers

7129 search results - page 27 / 1426
» Approximation Algorithms for Treewidth
Sort
View
68
Voted
IPL
2006
151views more  IPL 2006»
14 years 9 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
Approximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Jukka Suomela
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
15 years 1 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
INFOCOM
2012
IEEE
13 years 4 days ago
Reverse-engineering BitTorrent: A Markov approximation perspective
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
Ziyu Shao, Hao Zhang, Minghua Chen, Kannan Ramchan...
PODS
2012
ACM
240views Database» more  PODS 2012»
13 years 4 days ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney