• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Randomized algorithms for geometric optimization problems,” in Handbook of Randomization (2001)

by P K Agarwal, S Sen
Add To MetaCart

Tools

Sorted by:
Results 11 - 11 of 11

Chapter 1 Network Abstract Linear Programming with Application to Cooperative Target Localization∗

by Francesco Bullo
"... Abstract We identify a novel class of distributed optimization problems, namely a networked version of abstract linear programming. For such problems we propose distributed algorithms for networks with various connectivity and/or memory con-straints. Finally, we show how a suitable target localizati ..."
Abstract - Add to MetaCart
Abstract We identify a novel class of distributed optimization problems, namely a networked version of abstract linear programming. For such problems we propose distributed algorithms for networks with various connectivity and/or memory con-straints. Finally, we show how a suitable target localization problem can be tackled through appropriate linear programs. 1.1
(Show Context)

Citation Context

...2n+ eO( √ d logd)); the expectation is taken over the internal randomizations executed by the algorithm. An elegant survey on randomized methods in linear programming is [5]; see also [6]. The survey =-=[7]-=-, see also [8], discusses the application of abstract linear programming to a number of geometric optimization problems. Regarding parallel computation approaches to linear programming, we only note t...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University