Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Mai 2020
Genre:	EDV / Informatik
	algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / algorithmsanddatastructures / angewandte informatik / approximationalgorithms / approximationtheory / ArtificialIntelligence / bipartitegraphs / circuitsandBooleanfunctions / combinatorialoptimization / complexitytheory / computationalalgebraandgeometry / computationalbiology / computersystems / datastructures / Datenbanken / Datenmanagement / Diskrete Mathematik / Distributedandparallelalgorithms / engineering / Grafikprogrammierung / graphdrawingandlabelling / Graphtheoryandcombinatorics / MobileAgents / Netzwerk-Hardware / polynomialapproximation / signalprocessing mehr...
ISBN:	9783030489656
EAN-Code:	9783030489656
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 24 mm
Gewicht:	668 gr
Seiten:	444
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Coordinating swarms of objects at extreme dimensions.- A family of tree-based generators for bubbles in directed graphs.- The micro-world of cographs.- Parameterized Complexity of (A,`)-Path Packing.- On Proper Labellings of Graphs with Minimum Label Sum.- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework.- On the Complexity of Stackelberg Matroid Pricing Problems.- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.- Edge-Disjoint Branchings in Temporal Graphs.- Optimal In-place Algorithms for Basic Graph Problems.- Further Results on Online Node- and Edge-Deletion Problems with Advice.- Fair packing of independent sets.- Polynomial Time Algorithms for Tracking Path Problems.- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride.- Iterated Type Partitions.- Two Robots Patrolling on a Line: Integer Version and Approximability.- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges.- On the Complexity of Singly Connected Vertex Deletion.- Equitable d-degenerate choosability of graphs.- On the complexity of Broadcast Domination and Multipacking in digraphs.- A Parameterized Perspective on Attacking and Defending Elections.- Skyline Computation with Noisy Comparisons.- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings.- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.- The Steiner problem for count matroids.- Bounded Degree Group Steiner problems.- Between proper and strong edge-colorings of subcubic graphs.- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination.- Algorithms for Constructing Anonymizing Arrays.- Parameterized algorithms for partial vertex covers in bipartite graphs.- Acyclic Matching in Some Subclasses of Graphs.