Algorithmic Aspects in Information and Management 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Goldberg, Andrew V. (Επιμελητής έκδοσης), Zhou, Yunhong (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Σειρά:Lecture Notes in Computer Science, 5564
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03562nam a22005535i 4500
001 978-3-642-02158-9
003 DE-He213
005 20170107170635.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642021589  |9 978-3-642-02158-9 
024 7 |a 10.1007/978-3-642-02158-9  |2 doi 
040 |d GrThAP 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Algorithmic Aspects in Information and Management  |h [electronic resource] :  |b 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings /  |c edited by Andrew V. Goldberg, Yunhong Zhou. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2009. 
300 |a X, 327 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5564 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Numerical analysis. 
650 1 4 |a Computer Science. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Data Structures. 
650 2 4 |a Numeric Computing. 
650 2 4 |a Mathematics of Computing. 
700 1 |a Goldberg, Andrew V.  |e editor. 
700 1 |a Zhou, Yunhong.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642021572 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5564 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-02158-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)