APPROX 2007 - PDF Preprint Papers

APPROX 2007 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2007 Paper

click to vote

APPROX
2007
Springer

160views Algorithms» more APPROX 2007»

Better Binary List-Decodable Codes Via Multilevel Concatenation

14 years 5 months ago

Download www.cs.cmu.edu

We give a polynomial time construction of binary codes with the best currently known trade-oﬀ between rate and error-correction radius. Speciﬁcally, we obtain linear codes ove...

Venkatesan Guruswami, Atri Rudra

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	160	Better Binary List-Decodable Codes Via Multilevel Concatenation	claim
2	153	Distribution-Free Testing Lower Bounds for Basic Boolean Functions	claim
3	141	The Cover Time of Random Digraphs	claim
4	137	A Knapsack Secretary Problem with Applications	claim
5	115	Improved Approximation Algorithms for the Spanning Star Forest Problem	claim
6	112	Encouraging Cooperation in Sharing Supermodular Costs	claim
7	112	On Approximating the Average Distance Between Points	claim
8	106	Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems	claim
9	105	Properly 2-Colouring Linear Hypergraphs	claim
10	104	Worst-Case to Average-Case Reductions Revisited	claim
11	104	On the Benefits of Adaptivity in Property Testing of Dense Graphs	claim
12	102	Random Subsets of the Interval and P2P Protocols	claim
13	102	Hardness of Embedding Metric Spaces of Equal Size	claim
14	101	On the Approximation Resistance of a Random Predicate	claim
15	100	Implementing Huge Sparse Random Graphs	claim
16	99	Eigenvectors of Random Graphs: Nodal Domains	claim
17	99	On Estimating Frequency Moments of Data Streams	claim
18	99	Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems	claim
19	97	Optimal Resource Augmentations for Online Knapsack	claim
20	96	Soft Edge Coloring	claim
21	95	Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs	claim
22	92	Sublinear Algorithms for Approximating String Compressibility	claim
23	88	Derandomization of Euclidean Random Walks	claim
24	87	Stochastic Steiner Tree with Non-uniform Inflation	claim
25	86	Lower Bounds for Swapping Arthur and Merlin	claim
26	80	Coarse Differentiation and Multi-flows in Planar Graphs	claim
27	77	High Entropy Random Selection Protocols	claim
28	76	Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects	claim
29	67	Maximum Gradient Embeddings and Monotone Clustering	claim
30	63	Testing st -Connectivity	claim
31	60	A Sequential Algorithm for Generating Random Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers