APPROX 2008 - PDF Preprint Papers

APPROX 2008 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2008 Paper

click to vote

APPROX
2008
Springer

245views Algorithms» more APPROX 2008»

Approximating Optimal Binary Decision Trees

13 years 6 months ago

Download www.cs.williams.edu

Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....

Micah Adler, Brent Heeringa

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	245	Approximating Optimal Binary Decision Trees	claim
2	190	The Complexity of Local List Decoding	claim
3	184	Approximately Counting Embeddings into Random Graphs	claim
4	173	Connected Vertex Covers in Dense Graphs	claim
5	142	Approximating Maximum Subgraphs without Short Cycles	claim
6	137	Approximating Directed Weighted-Degree Constrained Networks	claim
7	135	The Directed Minimum Latency Problem	claim
8	134	Inapproximability of Survivable Networks	claim
9	128	Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness	claim
10	127	Approximating Single Machine Scheduling with Scenarios	claim
11	125	On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs	claim
12	124	Deterministic 7/8-Approximation for the Metric Maximum TSP	claim
13	119	The Complexity of Distinguishing Markov Random Fields	claim
14	111	Extractors for Three Uneven-Length Sources	claim
15	108	Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP	claim
16	107	A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One	claim
17	103	Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction	claim
18	102	Dense Fast Random Projections and Lean Walsh Transforms	claim
19	101	Learning Random Monotone DNF	claim
20	101	Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity	claim
21	100	A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem	claim
22	100	Optimal Random Matchings on Trees and Applications	claim
23	100	Corruption and Recovery-Efficient Locally Decodable Codes	claim
24	99	A 2-Source Almost-Extractor for Linear Entropy	claim
25	95	Sweeping Points	claim
26	94	Budgeted Allocations in the Full-Information Setting	claim
27	94	Improved Approximation Guarantees through Higher Levels of SDP Hierarchies	claim
28	91	Improved Separations between Nondeterministic and Randomized Multiparty Communication	claim
29	90	Tensor Products of Weakly Smooth Codes Are Robust	claim
30	89	Santa Claus Meets Hypergraph Matchings	claim
31	89	Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs	claim
32	88	Limitations of Hardness vs. Randomness under Uniform Reductions	claim
33	86	Small Sample Spaces Cannot Fool Low Degree Polynomials	claim
34	83	Sampling Hypersurfaces through Diffusion	claim
35	83	Near Optimal Dimensionality Reductions That Preserve Volumes	claim
36	79	Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size	claim
37	75	On the Query Complexity of Testing Orientations for Being Eulerian	claim
38	72	Increasing the Output Length of Zero-Error Dispersers	claim
39	71	Tight Bounds for Hashing Block Sources	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers