Sciweavers

Share
APPROX
2008
Springer
137views Algorithms» more  APPROX 2008»
8 years 12 months ago
Approximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
Zeev Nutov
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
9 years 5 days ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
APPROX
2008
Springer
102views Algorithms» more  APPROX 2008»
9 years 5 days ago
Dense Fast Random Projections and Lean Walsh Transforms
Random projection methods give distributions over k
Edo Liberty, Nir Ailon, Amit Singer
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
9 years 5 days ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
APPROX
2008
Springer
103views Algorithms» more  APPROX 2008»
9 years 5 days ago
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajia...
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
9 years 5 days ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
9 years 5 days ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
9 years 5 days ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
9 years 5 days ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
books