Search Results - "Non Numerical Algorithms and Problems—Routing and Layout"

Information gathering in adversarial systems: Lines and cycles

Authors: Kishore Kothapalli Christian Scheideler The Pennsylvania State University CiteSeerX Archives

Contributors: Kishore Kothapalli Christian Scheideler The Pennsylvania State University CiteSeerX Archives

Source: http://cstar.iiit.ac.in/~kkishore/gather-spaa.pdf.

Subject Terms: Categories and Subject Descriptors F.2.8 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Routing and layout, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.560.9619

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.560.9619
http://cstar.iiit.ac.in/~kkishore/gather-spaa.pdf

Approximation Algorithms for Time-Constrained Scheduling on Line Networks ABSTRACT

Authors: Harald Räcke Adi Rosén The Pennsylvania State University CiteSeerX Archives

Contributors: Harald Räcke Adi Rosén The Pennsylvania State University CiteSeerX Archives

Source: http://www.dcs.warwick.ac.uk/~harry/pdf/linenetworks.pdf.

Subject Terms: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design—Packet-Switching Network, Store and Forward Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Routing and Layout, Sequencing and Scheduling

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.957; http://www.dcs.warwick.ac.uk/~harry/pdf/linenetworks.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.957
http://www.dcs.warwick.ac.uk/~harry/pdf/linenetworks.pdf