human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "online primal dual for non linear optimization with applications to speed scaling"
  Abstract: We reinterpret some online greedy algorithms for a class of nonlinear "load-balancing" problems as solving a mathematical program online. For example, we consider the problem of assigning jobs to (unrelated) machines to minimize the sum of the alpha^{th}-powers of the loads plus assignment costs (the online Generalized Assignment Problem); or choosing paths to connect terminal pairs to minimize the alpha^{th}-powers of the edge loads (online routing with speed-scalable routers). We give analyses of these online algorithms using the dual of the primal program as a lower bound for the optimal algorithm, much in the spirit of online primal-dual results for linear problems. #R##N#We then observe that a wide class of uni-processor speed scaling problems (with essentially arbitrary scheduling objectives) can be viewed as such load balancing problems with linear assignment costs. This connection gives new algorithms for problems that had resisted solutions using the dominant potential function approaches used in the speed scaling literature, as well as alternate, cleaner proofs for other known results.

Connected through hyperedge HE-1 (induced by source paper "station assignment with reallocation"):
  with members:
    - "incentive mechanisms for participatory sensing survey and research challenges"
    - "a new perspective on the windows scheduling problem"
    - "dynamic windows scheduling with reallocation"
    - "reallocation problems in scheduling"
    - "on the value of job migration in online makespan minimization"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-2 (induced by source paper "approximating generalized network design under dis economies of scale with applications to energy efficiency"):
  with members:
    - "inner product spaces for minsum coordination mechanisms"

Connected through hyperedge HE-3 (induced by source paper "online primal dual algorithms with configuration linear programs"):
  with members:
    - "online covering with sum of ell_q norm objectives"
    - "online submodular maximization with preemption"
    - "online contention resolution schemes"
    - "welfare maximization with production costs a primal dual approach"
    - "tight bounds for online vector scheduling"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "optimal approximation for submodular and supermodular optimization with bounded curvature"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-4 (induced by source paper "online job scheduling with redundancy and opportunistic checkpointing a speedup function based analysis"):
  with members:
    - "task cloning algorithms in a mapreduce cluster with competitive performance bounds"
    - "optimization for speculative execution of multiple jobs in a mapreduce like cluster"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "when do redundant requests reduce latency"
    - "online scheduling on identical machines using srpt"

Connected through hyperedge HE-5 (induced by source paper "online convex covering and packing problems"):
  with members:
    - "welfare maximization with production costs a primal dual approach"
    - "online covering with convex objectives and applications"
    - "online packing and covering framework with convex objectives"
    - "approximating sparse covering integer programs online"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-6 (induced by source paper "primal dual and dual fitting analysis of online scheduling algorithms for generalized flow time problems"):
  with members:
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "how unsplittable flow covering helps scheduling with job dependent cost functions"
    - "the geometry of scheduling"
    - "greedy facility location algorithms analyzed using dual fitting with factor revealing lp"

Connected through hyperedge HE-7 (induced by source paper "welfare maximization with production costs a primal dual approach"):
  with members:
    - "convex program duality fisher markets and nash social welfare"
    - "fast algorithms for online stochastic convex programming"
    - "a rational convex program for linear arrow debreu markets"
    - "limitations of randomized mechanisms for combinatorial auctions"
    - "welfare and profit maximization with production costs"
    - "from convex optimization to randomized mechanisms toward optimal combinatorial auctions"
    - "market equilibrium with transaction costs"
    - "auctions with online supply"

Connected through hyperedge HE-8 (induced by source paper "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"):
  with members:
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "minimum latency submodular cover"
    - "ranking with submodular valuations"
    - "a truthful mechanism for offline ad slot scheduling"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DS(Data Structures and Algorithms)