The following pages link to Vijay V. Vazirani (Q593777):
Displayed 50 items.
- A natural encoding scheme proved probabilistic polynomial complete (Q593778) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479) (← links)
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
- An auction-based market equilibrium algorithm for a production model (Q883996) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Item:Q593777 (redirect page) (← links)
- Scheduling open shops with parallel machines (Q1167065) (← links)
- NP-completeness of some generalizations of the maximum matching problem (Q1168728) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- On-line algorithms for weighted bipartite matching and stable marriages (Q1342235) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657) (← links)
- The general graph matching game: approximate core (Q2078093) (← links)
- A real polynomial for bipartite graph minimum weight perfect matchings (Q2094360) (← links)
- Diversity in times of adversity: probabilistic strategies in microbial survival games (Q2193132) (← links)
- A microbial modified prisoner's dilemma game: how frequency-dependent selection can lead to random phase variation (Q2193133) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- A computationally motivated definition of parametric estimation and its applications to the Gaussian distribution (Q2568500) (← links)
- Majorizing estimators and the approximation of #P-complete problems (Q2819556) (← links)
- A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It (Q2884301) (← links)
- Learning Economic Parameters from Revealed Preferences (Q2936997) (← links)
- Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents (Q3008032) (← links)
- Market equilibrium under separable, piecewise-linear, concave utilities (Q3016257) (← links)
- Maximum matchings in general graphs through randomization (Q3031945) (← links)
- The Two-Processor Scheduling Problem is in Random NC (Q3034827) (← links)
- Design is as Easy as Optimization (Q3084225) (← links)
- A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It (Q3162518) (← links)
- 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties (Q3162530) (← links)
- (Q3165947) (← links)
- Spending Constraint Utilities with Applications to the Adwords Market (Q3169102) (← links)
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
- Settling Some Open Problems on 2-Player Symmetric Nash Equilibria (Q3449600) (← links)
- Market equilibrium via a primal--dual algorithm for a convex program (Q3452188) (← links)
- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem (Q3503858) (← links)
- Nash Bargaining Via Flexible Budget Markets (Q3511408) (← links)
- (Q3524714) (← links)
- Random Bichromatic Matchings (Q3525759) (← links)
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571) (← links)
- AdWords and generalized online matching (Q3546342) (← links)
- (Q3549634) (← links)
- A stochastic process on the hypercube with applications to peer-to-peer networks (Q3581257) (← links)
- Accelerating simulated annealing for the permanent and combinatorial counting problems (Q3581599) (← links)