Algorithmic Aspects in Information and Management
Springer Berlin (Verlag)
978-3-642-02157-2 (ISBN)
Algorithmic Challenge in Online Advertising.- Parallel Algorithms for Collaborative Filtering.- On the Approximability of Some Haplotyping Problems.- On Acyclicity of Games with Cycles.- Discrete online TSP.- On Approximating an Implicit Cover Problem in Biology.- Power Indices in Spanning Connectivity Games.- Efficiently Generating k-Best Solutions to Procurement Auctions.- Integer Polyhedra for Program Analysis.- Line Segment Facility Location in Weighted Subdivisions.- Algorithms for Placing Monitors in a Flow Network.- Three Results on Frequency Assignment in Linear Cellular Networks.- Link Distance and Shortest Path Problems in the Plane.- Orca Reduction and ContrAction Graph Clustering.- Equiseparability on Terminal Wiener Index.- Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.- Optimal Auctions Capturing Constraints in Sponsored Search.- A Note on Estimating Hybrid Frequency Moment of Data Streams.- Two-Level Push-Relabel Algorithm for the Maximum Flow Problem.- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.- Dynamic Position Auctions with Consumer Search.- Nonlinear Optimization over a Weighted Independence System.- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers.- Latency Constrained Aggregation in Chain Networks Admits a PTAS.- Cutting a Cake for Five People.- PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications.- On Job Scheduling with Preemption Penalties.
Erscheint lt. Verlag | 25.5.2009 |
---|---|
Reihe/Serie | Information Systems and Applications, incl. Internet/Web, and HCI | Lecture Notes in Computer Science |
Zusatzinfo | X, 327 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 515 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik | |
Schlagworte | Algorithm analysis and problem complexity • Algorithmen • algorithmic • algorithms • cellular networks • Clustering • Collaborative Filtering • Computer Science • connectivity games • data structure • data structures • discrete TSP • Games • Game Theory • graph clustering • haplotyping • Hardcover, Softcover / Informatik, EDV/Informatik • Information Management • Internet • Management • network analysis • Operations Research • Parallel Algorithms • polyhedra • preemption • traveling salesman |
ISBN-10 | 3-642-02157-3 / 3642021573 |
ISBN-13 | 978-3-642-02157-2 / 9783642021572 |
Zustand | Neuware |
Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich