Amanote Research
Register
Sign In
A Nearly Optimal Oracle for Avoiding Failed Vertices and Edges
doi 10.1145/1536414.1536431
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2009
Authors
Aaron Bernstein
David Karger
Publisher
ACM Press
Related search
Small Convex Polytopes With Long Edges and Many Vertices
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Optimal Paths for Avoiding a Radiating Source
Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros
Computers and Mathematics with Applications
Mathematics
Computational Mathematics
Simulation
Modeling
Computational Theory
Optimal Paths for Avoiding a Radiating Source
Nearly Time-Optimal Paths for a Ground Vehicle
Journal of Control Theory and Applications
Nearly Optimal Pricing for Multiproduct Firms
A Conjecture of M. Golomb on Optimal and Nearly-Optimal Linear Approximation
Bulletin of the American Mathematical Society
Finding Nearly Optimal GDT Scores
Journal of Computational Biology
Genetics
Molecular Biology
Computational Theory
Simulation
Computational Mathematics
Mathematics
Modeling
Figure 5: The Typical Explanation for How to Draw the Vertices and Edges in an I-Cube.
