| 2008 |
|---|
| 59 | EE | Shipra Agrawal,
Zizhuo Wang,
Yinyu Ye:
Parimutuel Betting on Permutations
CoRR abs/0804.2288: (2008) |
| 58 | EE | Yinyu Ye:
A path to the Arrow-Debreu competitive market equilibrium.
Math. Program. 111(1-2): 315-348 (2008) |
| 2007 |
|---|
| 57 | EE | Lihua Chen,
Yinyu Ye,
Jiawei Zhang:
A Note on Equilibrium Pricing as Convex Optimization.
WINE 2007: 7-16 |
| 56 | EE | Mark Peters,
Anthony Man-Cho So,
Yinyu Ye:
Pari-Mutuel Markets: Mechanisms and Performance.
WINE 2007: 82-95 |
| 55 | EE | Qiaoming Han,
Abraham P. Punnen,
Yinyu Ye:
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR abs/0712.3335: (2007) |
| 54 | EE | Anthony Man-Cho So,
Yinyu Ye:
Theory of semidefinite programming for Sensor Network Localization.
Math. Program. 109(2-3): 367-384 (2007) |
| 53 | EE | Anthony Man-Cho So,
Jiawei Zhang,
Yinyu Ye:
On approximating complex quadratic optimization problems via semidefinite programming relaxations.
Math. Program. 110(1): 93-110 (2007) |
| 52 | EE | Kasturi R. Varadarajan,
Srinivasan Venkatesh,
Yinyu Ye,
Jiawei Zhang:
Approximating the Radii of Point Sets.
SIAM J. Comput. 36(6): 1764-1776 (2007) |
| 51 | EE | Yinyu Ye:
Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality.
Theor. Comput. Sci. 378(2): 134-142 (2007) |
| 2006 |
|---|
| 50 | EE | Anthony Man-Cho So,
Jiawei Zhang,
Yinyu Ye:
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level.
APPROX-RANDOM 2006: 224-235 |
| 49 | EE | Bruno Codenotti,
Amin Saberi,
Kasturi R. Varadarajan,
Yinyu Ye:
Leontief economies encode nonzero sum two-player games.
SODA 2006: 659-667 |
| 48 | EE | Anthony Man-Cho So,
Yinyu Ye:
A semidefinite programming approach to tensegrity theory and realizability of graphs.
SODA 2006: 766-775 |
| 47 | EE | Bo Chen,
Yinyu Ye,
Jiawei Zhang:
Lot-sizing scheduling with batch setup times.
J. Scheduling 9(3): 299-310 (2006) |
| 46 | EE | Yinyu Ye:
Improved complexity results on solving real-number linear feasibility problems.
Math. Program. 106(2): 339-363 (2006) |
| 45 | EE | Mohammad Mahdian,
Yinyu Ye,
Jiawei Zhang:
Approximation Algorithms for Metric Facility Location Problems.
SIAM J. Comput. 36(2): 411-432 (2006) |
| 44 | EE | Pratik Biswas,
Tzu-Chen Lian,
Ta-Chung Wang,
Yinyu Ye:
Semidefinite programming based algorithms for sensor network localization.
TOSN 2(2): 188-220 (2006) |
| 2005 |
|---|
| 43 | | Xiaotie Deng,
Yinyu Ye:
Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings
Springer 2005 |
| 42 | EE | Yinyu Ye:
Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions.
AAIM 2005: 3-5 |
| 41 | EE | Anthony Man-Cho So,
Jiawei Zhang,
Yinyu Ye:
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations.
IPCO 2005: 125-135 |
| 40 | EE | Anthony Man-Cho So,
Yinyu Ye:
Theory of semidefinite programming for sensor network localization.
SODA 2005: 405-414 |
| 39 | EE | Kamal Jain,
Vijay V. Vazirani,
Yinyu Ye:
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production.
SODA 2005: 63-71 |
| 38 | EE | Yinyu Ye:
Exchange Market Equilibria with Leontief's Utility: Freedom of Pricing Leads to Rationality.
WINE 2005: 14-23 |
| 37 | EE | Anthony Man-Cho So,
Yinyu Ye:
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams.
WINE 2005: 584-593 |
| 36 | EE | Bruno Codenotti,
Amin Saberi,
Kasturi R. Varadarajan,
Yinyu Ye:
Leontief Economies Encode Nonzero Sum Two-Player Games
Electronic Colloquium on Computational Complexity (ECCC)(055): (2005) |
| 35 | EE | J. Maurice Rojas,
Yinyu Ye:
On solving univariate sparse polynomials in logarithmic time.
J. Complexity 21(1): 87-110 (2005) |
| 2004 |
|---|
| 34 | EE | Jiawei Zhang,
Bo Chen,
Yinyu Ye:
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract).
IPCO 2004: 219-233 |
| 33 | EE | Pratik Biswas,
Yinyu Ye:
Semidefinite programming for ad hoc wireless sensor network localization.
IPSN 2004: 46-54 |
| 32 | EE | Jiawei Zhang,
Yinyu Ye,
Qiaoming Han:
Improved approximations for max set splitting and max NAE SAT.
Discrete Applied Mathematics 142(1-3): 133-149 (2004) |
| 31 | EE | Alexander A. Ageev,
Yinyu Ye,
Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
SIAM J. Discrete Math. 18(1): 207-217 (2004) |
| 2003 |
|---|
| 30 | EE | Alexander A. Ageev,
Yinyu Ye,
Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
ICALP 2003: 145-156 |
| 29 | EE | Heng Yang,
Yinyu Ye,
Jiawei Zhang:
An approximation algorithm for scheduling two parallel machines with capacity constraints.
Discrete Applied Mathematics 130(3): 449-467 (2003) |
| 2002 |
|---|
| 28 | EE | Mohammad Mahdian,
Yinyu Ye,
Jiawei Zhang:
Improved Approximation Algorithms for Metric Facility Location Problems.
APPROX 2002: 229-242 |
| 27 | EE | Qiaoming Han,
Yinyu Ye,
Hantao Zhang,
Jiawei Zhang:
On approximation of max-vertex-cover.
European Journal of Operational Research 143(2): 342-355 (2002) |
| 26 | EE | Jiawei Zhang,
Yinyu Ye:
A note on the maximization version of the multi-level facility location problem.
Oper. Res. Lett. 30(5): 333-335 (2002) |
| 1998 |
|---|
| 25 | | Minyue Fu,
Zhi-Quan Luo,
Yinyu Ye:
Approximation Algorithms for Quadratic Programming.
J. Comb. Optim. 2(1): 29-50 (1998) |
| 24 | | Yinyu Ye:
On the complexity of approximating a KKT point of quadratic programming.
Math. Program. 80: 195-211 (1998) |
| 23 | | Michael J. Todd,
Yinyu Ye:
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Math. Program. 81: 1-21 (1998) |
| 1997 |
|---|
| 22 | | Yinyu Ye:
Complexity analysis of the analytic center cutting plane method that uses multiple cuts.
Math. Program. 77: 85-104 (1997) |
| 1996 |
|---|
| 21 | EE | Yinyu Ye:
How Partial Knowledge Helps to Solve Linear Programs.
J. Complexity 12(4): 480-491 (1996) |
| 20 | | Stephen A. Vavasis,
Yinyu Ye:
A primal-dual interior point method whose running time depends only on the constraint matrix.
Math. Program. 74: 79-120 (1996) |
| 19 | | Benjamin Jansen,
Kees Roos,
Tamás Terlaky,
Yinyu Ye:
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program. 76: 117-130 (1996) |
| 18 | | Kenneth O. Kortanek,
Xiaojie Xu,
Yinyu Ye:
An infeasible interior-point algorithm for solving primal and dual geometric programs.
Math. Program. 76: 155-181 (1996) |
| 17 | | Yinyu Ye:
On homogeneous and self-dual algorithms for LCP.
Math. Program. 76: 211-221 (1996) |
| 1995 |
|---|
| 16 | | Richard A. Tapia,
Yin Zhang,
Yinyu Ye:
On the convergence of the iteration sequence in primal-dual interior-point methods.
Math. Program. 68: 141-154 (1995) |
| 1994 |
|---|
| 15 | EE | Stephen A. Vavasis,
Yinyu Ye:
An accelerated interior point method whose running time depends only on A (extended abstract).
STOC 1994: 512-521 |
| 14 | EE | Yinyu Ye:
Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions.
J. Complexity 10(3): 271-280 (1994) |
| 1993 |
|---|
| 13 | | Yinyu Ye,
Kenneth O. Kortanek,
J. Kaliski,
S. Huang:
Near boundary behavior of primal-dual potential reduction algorithms for linear programming.
Math. Program. 58: 243-255 (1993) |
| 12 | | Yinyu Ye,
Osman Güler,
Richard A. Tapia,
Yin Zhang:
A quadratically convergent O(qudra root(n)*L)-iteration algorithm for linear programming.
Math. Program. 59: 151-162 (1993) |
| 11 | | Osman Güler,
Yinyu Ye:
Convergence behavior of interior-point algorithms.
Math. Program. 60: 215-228 (1993) |
| 10 | | Sanjay Mehrotra,
Yinyu Ye:
Finding an interior point in the optimal face of linear programs.
Math. Program. 62: 497-515 (1993) |
| 9 | | Yinyu Ye,
Kurt M. Anstreicher:
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP.
Math. Program. 62: 537-551 (1993) |
| 1992 |
|---|
| 8 | | Masakazu Kojima,
Nimrod Megiddo,
Yinyu Ye:
An interior point potential reduction algorithm for the linear complementarity problem.
Math. Program. 54: 267-279 (1992) |
| 7 | | Yinyu Ye:
On affine scaling algorithms for nonconvex quadratic programming.
Math. Program. 56: 285-300 (1992) |
| 6 | | Yinyu Ye:
On the finite convergence of interior-point algorithms for linear programming.
Math. Program. 57: 325-335 (1992) |
| 1991 |
|---|
| 5 | | Yinyu Ye:
An O(n3L) potential reduction algorithm for linear programming.
Math. Program. 50: 239-258 (1991) |
| 4 | | Yinyu Ye:
Comparative analysis of affine scaling algorithms based on simplifying assumptions.
Math. Program. 52: 405-414 (1991) |
| 1990 |
|---|
| 3 | | Yinyu Ye:
A "Build-Down" Scheme for Linear Programming.
Math. Program. 46: 61-72 (1990) |
| 2 | | Yinyu Ye,
Michael J. Todd:
Containing and Shrinking Ellipsoids in the Path-Following Algorithm.
Math. Program. 47: 1-9 (1990) |
| 1 | | Yinyu Ye:
A Class of Projective Transformations for Linear Programming.
SIAM J. Comput. 19(3): 457-466 (1990) |
