The following pages link to Sanjiv Kapoor (Q833708):
Displayed 36 items.
- Visibility queries in a polygonal region (Q833709) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- An auction-based market equilibrium algorithm for a production model (Q883996) (← links)
- Stochastic rearrangement rules for self-organizing data structures (Q922688) (← links)
- (Q1079341) (redirect page) (← links)
- Recurrence relations based on minimization and maximization (Q1079343) (← links)
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799) (← links)
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q1386771) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Speeding up Karmarkar's algorithm for multicommodity flows (Q1915810) (← links)
- An algorithm for enumerating all spanning trees of a directed graph (Q1977130) (← links)
- Equilibrium and inefficiency in multi-product Cournot games (Q2190395) (← links)
- Bounded-diameter minimum-cost graph problems (Q2464340) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- Efficient computation of geodesic shortest paths (Q2819608) (← links)
- Auction algorithms for market equilibrium (Q3581006) (← links)
- Geodesic Spanners on Polyhedral Surfaces (Q3652207) (← links)
- (Q4037441) (← links)
- (Q4473930) (← links)
- Dynamic Maintenance of Maxima of 2-d Point Sets (Q4507328) (← links)
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles (Q4507375) (← links)
- Nash Equilibrium and Stability in Network Selection Games (Q4588252) (← links)
- On minimum 3-cuts and approximating k-cuts using Cut Trees (Q4645919) (← links)
- Optimum lopsided binary trees (Q4710685) (← links)
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs (Q4834379) (← links)
- New Techniques for Exact and Approximate Dynamic Closest-Point Problems (Q4895830) (← links)
- PROXIMITY STRUCTURES FOR GEOMETRIC GRAPHS (Q4931730) (← links)
- A Simple and Efficient Algorithm for Computing Market Equilibria (Q4962611) (← links)
- Faster enumeration of all spanning trees of a directed graph (Q5057454) (← links)
- Price of Anarchy in Networks with Heterogeneous Latency Functions (Q5119855) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313016) (← links)
- Auction Algorithms for Market Equilibrium (Q5388005) (← links)
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
- (Q5875571) (← links)
- Algorithms - ESA 2003 (Q5897239) (← links)
- Algorithms and Data Structures (Q5900768) (← links)