Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Januar 2007
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / C / Computer Graphics / computer science / Computer science—Mathematics / Data Science / Data Structures / Data structures (Computer science) / Datenbanken / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Grafikprogrammierung / Graphics programming / Mathematical theory of computation / Mathematik für Informatiker / Maths for computer scientists / Numeric Computing / Numerical analysis / Numerische Mathematik / Operating systems / Software Engineering / Software Engineering/Programming and Operating Systems mehr...
ISBN:	9783540695134
EAN-Code:	9783540695134
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#4368 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	1130 gr
Seiten:	346
Illustration:	X, 346 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Approximation Algorithms for Scheduling Problems with Exact Delays.- Bidding to the Top: VCG and Equilibria of Position-Based Auctions.- Coping with Interference: From Maximum Coverage to Planning Cellular Networks.- Online Dynamic Programming Speedups.- Covering Many or Few Points with Unit Disks.- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.- Online k-Server Routing Problems.- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.- A Randomized Algorithm for Online Unit Clustering.- On Hierarchical Diameter-Clustering, and the Supplier Problem.- Bin Packing with Rejection Revisited.- On Bin Packing with Conflicts.- Approximate Distance Queries in Disk Graphs.- Network Design with Edge-Connectivity and Degree Constraints.- Approximating Maximum Cut with Limited Unbalance.- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.- Improved Online Hypercube Packing.- Competitive Online Multicommodity Routing.- The k-Allocation Problem and Its Variants.- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.- Approximation Algorithms for Multi-criteria Traveling Salesman Problems.- The Survival of the Weakest in Networks.- Online Distributed Object Migration.