|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910484194903321 |
|
|
Titolo |
Algorithmic aspects in information and management : 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009, proceedings / / [edited by] Rudolf Fleischer, Jinhui Xu |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
New York, : Springer, 2009 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 327 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science ; ; 5564 |
|
|
|
|
|
|
Altri autori (Persone) |
|
FleischerRudolf <1964-> |
XuJinhui |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Management science - Mathematical models |
Computer algorithms |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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 |
|
|
|
|