Joseph Naor
- Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
1998/02/01 by G. Even, Guy Even, J. (Seffi) Naor +5 · 8 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Binary logarithm #Combinatorics #Directed graph #Discrete mathematics #Feedback arc set #Feedback vertex set #Generalization #Graph #Interconnection Networks and Systems #Line graph #Mathematics #Theory of computation #VLSI and FPGA Design Techniques #Vertex (graph theory)
- A unified approach to approximating resource allocation and scheduling
2001/09/01 by Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund +2 · 6 citations
Computer Science · #Complexity and Algorithms in Graphs #Distributed and Parallel Computing Systems #Optimization and Search Problems
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
2007/09/14 by Niv Buchbinder, Kamal Jain, Joseph Naor +1 · 5 citations
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Auction Theory and Applications #Optimization and Search Problems
- O(depth)-Competitive Algorithm for Online Multi-level Aggregation
2017/01/08 by Niv Buchbinder, Moran Feldman, Buchbinder, Niv +5 · 4 citations
Business, Management and Accounting · Computer Science · Engineering · #Facility Location and Emergency Management #Optimization and Search Problems #Vehicle Routing Optimization Methods #acm:68Q25 #acm:68W27 #cs.DS #msc:68Q25 #msc:68W27
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
1990/02/01 by Amotz Bar-Noy, Joseph Naor · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Binary logarithm #Combinatorics #Computer science #Discrete mathematics #Graph #Hamiltonian path #Limits and Structures in Graph Theory #Log-log plot #Mathematics #Path (computing) #Set (abstract data type) #Sorting #Sorting algorithm #Tournament #semigroups and automata theory
- The greedy algorithm is optimal for on-line edge coloring
1992/12/01 by Amotz Bar-Noy, Rajeev Motwani, Joseph Naor · 1 citation
Computer Science · Engineering · Mathematics · #Algorithm #Artificial intelligence #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Edge coloring #Enhanced Data Rates for GSM Evolution #Graph #Greedy algorithm #Greedy coloring #Line (geometry) #Line graph #Mathematics #Optimization and Packing Problems #Optimization and Search Problems #Theoretical computer science
- Fast parallel algorithms for chordal graphs
1987/01/01 by Joseph Naor, Moni Naor, Alejandro A. Schäffer · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Complexity and Algorithms in Graphs #Chordal graph #Interval graph #Graph coloring #Computer science #Split graph #Intersection (aeronautics) #Algorithm #Treewidth #Combinatorics #Indifference graph #Mathematics #Graph #Discrete mathematics #Pathwidth #Theoretical computer science #1-planar graph #Line graph
- Small-bias probability spaces: efficient constructions and applications
1990/01/01 by Joseph Naor, Moni Naor · 1 citation
Computer Science · Engineering · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Wireless Communication Security Techniques #IBM #Citation #Research center #Computer science #Center (category theory) #Operations research #Library science #World Wide Web #Information retrieval #Engineering #Political science #Physics
- Submodular Maximization with Cardinality Constraints
2013/12/18 by Niv Buchbinder, Moran Feldman, Joseph Naor +1 · 1 citation
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Advanced Graph Theory Research #Submodular set function #Cardinality (data modeling) #Monotone polygon #Approximation algorithm #Maximization #Range (aeronautics) #Constraint (computer-aided design) #Function (biology) #Greedy algorithm #Mathematical optimization #Computer science #Discrete mathematics #Mathematics #Combinatorics