The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yinyu Ye: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  55. Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks. [Citation Graph (, )][DBLP]


  56. A unified framework for dynamic pari-mutuel information market design. [Citation Graph (, )][DBLP]


  57. Correlation Robust Stochastic Optimization. [Citation Graph (, )][DBLP]


  58. Computational Economy Equilibrium and Application. [Citation Graph (, )][DBLP]


  59. Parimutuel Betting on Permutations. [Citation Graph (, )][DBLP]


  60. A Note on Equilibrium Pricing as Convex Optimization. [Citation Graph (, )][DBLP]


  61. Pari-Mutuel Markets: Mechanisms and Performance. [Citation Graph (, )][DBLP]


  62. A FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium. [Citation Graph (, )][DBLP]


  63. Preface. [Citation Graph (, )][DBLP]


  64. A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs [Citation Graph (, )][DBLP]


  65. Parimutuel Betting on Permutations [Citation Graph (, )][DBLP]


  66. Stochastic Combinatorial Optimization under Probabilistic Constraints [Citation Graph (, )][DBLP]


  67. Learning to rank with combinatorial Hodge theory [Citation Graph (, )][DBLP]


  68. Distributionally Robust Stochastic Programming with Binary Random Variables [Citation Graph (, )][DBLP]


  69. Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit [Citation Graph (, )][DBLP]


  70. A Dynamic Near-Optimal Algorithm for Online Linear Programming [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002