Items where Subject is "68-XX Computer science > 68Qxx Theory of computing > 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: B | E | F | G
Number of items at this level: 7.


Buchheim, Christoph and Cameron, Peter J. and Wu, Taoyang (2009) On the Subgroup Distance Problem.
Published in: Discrete Mathematics Vol. 309 (4). pp. 962-968.


Engels, Birgit and Krumke, Sven and Schrader, Rainer and Zeck, Christiane (2009) Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.
Published In: Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization 2009, pp. 239-243.

Engels, Birgit and Schrader, Rainer (2015) Freight car dispatching with generalized flows.
Published in: Networks Vol. 66 (1). pp. 33-39. ISSN 1097-0037


Fuchs, Bernhard (2007) On the Approximability of Range Assignment Problems. PhD thesis.

Fuchs, Bernhard (2006) On the Hardness of Range Assignment Problems.
Published In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings, Lecture notes in computer science. 3998 Springer 2006, pp. 127-138.

Fuchs, Bernhard and Faigle, Ulrich and Peis, Britta (2007) Note on maximal split-stable subgraphs.
Published in: Discrete applied mathematics Vol. 155 (15). pp. 2031-2038.


Groß, Martin and Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2012) Approximating Earliest Arrival Flows in Arbitrary Networks.
Published In: Algorithms – ESA 2012, Lecture Notes in Computer Science. 7501 Springer 2012, pp. 551-562.

This list was generated on Sat Nov 26 20:05:06 2022 CET.